CGAL users discussion list

[Olumide <>]

Mariette Yvinec wrote:
> Once the first point has been located, the line_face_circulator of cgal  
> is going to visit only faces traversed by the query
> segment. Thus the complexity is equal to the number of intersection 
> point found and not
> to its worst case which is effectively p*m

Thank you very much for your patience.

Is the line_face_circulator in implementation of a published algorithm? 
If so, I'd like to read about it. As I said in a previous email, I need 
to write a bit about whichever method I decide upon.

Regards,

- Olumide