Subject: CGAL users discussion list
List archive
- 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
Is it worth it to build a tree? what other approach could I follow? Iterating over all the faces seems highly inefficient.I don't have that many queries, around 200 of them. I might have, however, lots of points, > 200 milion.But I don't understand andreas for the second approach.I've seen this post: http://cgal-discuss.949826.n4.nabble.com/Intersection-segment-and-cells-from-3D-Delaunay-triangulation-td4660891.htmlHello all,How can I intersect a 3d ray with a 2D Constrained Delaunay Triangulation created from 3d points using the project_xy traits?
for one ray, you could iterate on the faces intersecting the ray in projection using the line-face-circulator.
- [cgal-discuss] Intersection of a ray and a delaunay triangulation, Pol Monsó Purtí Helimap, 03/24/2016
- Re: [cgal-discuss] Intersection of a ray and a delaunay triangulation, Olivier Devillers, 03/24/2016
- Re: [cgal-discuss] Intersection of a ray and a delaunay triangulation, Andreas Fabri, 03/24/2016
- Re: [cgal-discuss] Intersection of a ray and a delaunay triangulation, Pol Monsó Purtí Helimap, 03/24/2016
- Re: [cgal-discuss] Intersection of a ray and a delaunay triangulation, Andreas Fabri, 03/24/2016
- Re: [cgal-discuss] Intersection of a ray and a delaunay triangulation, Olivier Devillers, 03/24/2016
Archive powered by MHonArc 2.6.18.