CGAL users discussion list

[Benjamin SCHWARZ <>]

Hi list,

        Given a Regular_triangulation_3 T, and two vertices v1 and v2 of T, 
I'd like to be able to visit all simplices on the segment joining v1 to v2.

    I can imagine a recursive algorithm progressing from simplex to simplex, 
each time tracing the next intersection of the beam through the surrounding 
simplices. I have the feeling this is a common problematics, related with the 
construction of a Delaunay triangulation, hence I'd like to know if there is 
already some code to do that.


       --Ben