CGAL users discussion list

[Andreas Fabri <>]

The AABB tree is only worth it if you have many query segments.

A third alternative is to locate an endpoint in the triangulation
and to walk towards the other end point collecting the cells
you traverse.

andreas

On 03/06/2015 11:28, Mauricio Diaz wrote:
> 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

--
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project

phone: +33.492.954.912    skype: andreas.fabri