CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

Hi Ben,

If I understand your question correctly, you need to do:

Cell_handle c;
int i,j;
T.is_edge(v1,v2,c,i,j);

Facet_circulator fcirc=t.incident_facets(c,i,j);

See
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Triangulation_3_ref/Class_Triangulation_3.html

for the details.

Sebastien.

On 07/10/2012 11:56 AM, Benjamin SCHWARZ wrote:
> 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