CGAL users discussion list

[Andreas Fabri <>]

You might have a look at the Line_face_circulator.
It allows to traverse all triangles intersected by a Line_2

andreas


Tyver Ray wrote:
> Hello!
>
> There's a sublime figure that I've created just for you!!
>
> If I want to select all the triangles (red, orange and green on the 
> figure) that have their vertices on the black edge on the figure below, 
> do I have to iterate on all finite vertices and compare the vertices to 
> the all the points on the black edge?
> If I have 200 000 triangles it will take a long time...Do you have 
> another idea or method or if there's not please tell me!
>
>
> | ¬
> |    ¬
> |        ¬
> |     ¬    ¬
> |¬          ¬
> |    ¬       ¬
> |        ¬   ¬
> |¬   ¬      ¬
>
>
> Thank you!
>
> Tyv