Hi, I would like to achieve the best possible performance when iteratively

uniting (2D boolean union) 2D triangles into one larger polygon. I expect to

unite a lot of triangles, so I think that using a BSP tree for the larger

polygon would be useful. I expect CGAL to use BSP trees, but I think that

the default behaviour for CGAL would be to reconstruct the tree every time I

called the CGAL::join() function to add another triangle. What should I do

to avoid reconstructing the BSP tree? I should stress that I have to perform

the unions iteratively - I can't unite them all at once.

Also, given the scenario, is there a faster way to perform this than to use

Polygon_2 for the individual triangles, Polygon_with_holes_2 for the

resulting polygon and then CGAL::join them together? I know there is a class

Triangle_2, but the CGAL::join() doesn't seem to accept it as an input.

Thank you.

--

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