Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Intersection of a ray and a delaunay triangulation

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Intersection of a ray and a delaunay triangulation


Chronological Thread 
  • From: Olivier Devillers <>
  • To:
  • Subject: Re: [cgal-discuss] Intersection of a ray and a delaunay triangulation
  • Date: Thu, 24 Mar 2016 13:19:34 +0100


On 24 Mar 2016, at 12:33, Pol Monsó Purtí Helimap <> wrote:

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.

for one ray, you could iterate on the faces intersecting the ray in projection using the line-face-circulator.




Archive powered by MHonArc 2.6.18.

Top of Page