CGAL users discussion list

[Pol Monsó Purtí Helimap <>]

Hello all,

How can I intersect a 3d ray with a 2D Constrained Delaunay Triangulation created from 3d points using the project_xy traits?

I've seen this post: http://cgal-discuss.949826.n4.nabble.com/Intersection-segment-and-cells-from-3D-Delaunay-triangulation-td4660891.html

But I don't understand andreas for the second approach.

I don't have that many queries, around 200 of them. I might have, however, lots of points, > 200 milion.

Is it worth it to build a tree? what other approach could I follow? Iterating over all the faces seems highly inefficient.

Cheers,

Pol

Some typedefs I have, to give some context:

typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef CGAL::Projection_traits_xy_3<K>  Gt;
typedef K::Point_3   Point3;

typedef CGAL::Triangulation_vertex_base_2<Gt> Vb;
typedef CGAL::Delaunay_mesh_face_base_2<Gt> Fb;
typedef CGAL::Triangulation_data_structure_2<Vb, Fb> Tds;
typedef CGAL::Constrained_Delaunay_triangulation_2<Gt, Tds> CDT;