CGAL users discussion list

[Mauricio Diaz <>]

Hi,

I wonder how to calculate the intersections between a 3D segment and some cells from a 3D Delaunay triangulation.

From the documentation, I understand two ways to do it:  

- By iterating all over the finite cells of the 3D triangulation and calculating CGAL::intersection(segment, cell)

- By construction an AABB tree of the cells (the triangle facets) and finding the intersections with the segment.

Which of these two options is more efficient? Any different suggestion? 

Thanks,

- Mauricio DIAZ