CGAL users discussion list

[Tapadi <>]

Hi,

Another way to do it would be to insert all triangles into an Arrangement_2
and to perform point locations on all segments' endpoints.

I'm not very aware about performances of CGAL data structures and
algorithms, but at least it would avoid the initialization of 3D structures
and the computation of intersections in 3D space.

Regards,
Hugo Loi
PhD student at Inria - Maverick team



--
View this message in context: 
http://cgal-discuss.949826.n4.nabble.com/Efficient-way-to-test-if-a-set-of-Segment-2-intersects-the-interior-of-a-Triangle-2-tp4658516p4658524.html
Sent from the cgal-discuss mailing list archive at Nabble.com.