CGAL users discussion list

[Efi Fogel <>]

The intermediate data is a 2D arrangement.

You can work directly with the arrangement data structure.

For starters, you can create a Polygon_set_2 object, say PS, call the PS.join(range-of-polygons) function, and obtain the underlying arrangement via the call PS.arrangement().

   ____  _        ____             _
  /_____/_) o    /__________  __  //
 (____ (   (    (    (_/ (_/-(-'_(/
                         _/

On Mon, 18 Mar 2019 at 16:01, tfmk <> wrote:

Thank you Efi,

I've looked at the code and I found the default parameter 'int k=5'. I will
experiment with the value, but right now I still have to complete some
essential parts of my program to do so.

However, I'm not sure if it allows me to do what I need. What I meant to ask
was if there is any way to obtain intermediate results that the algorithm
creates, and use those results in its later invocations. So for example I
would call CGAL::join() (or similar function) and receive not only the
resulting polygon, but also some data which I could later give by argument
to the next CGAL::join() call, which would help the algorithm perform better
(for example it wouldn't need to "construct the BSP tree again"). I looked
at the code more closely but right now I can't find what I'm looking for.



--
Sent from: http://cgal-discuss.949826.n4.nabble.com/

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://sympa.inria.fr/sympa/info/cgal-discuss