Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Intersect points of a Complex Polygon and a Flat Mesh

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Intersect points of a Complex Polygon and a Flat Mesh


Chronological Thread 
  • From: Mariette Yvinec <>
  • To:
  • Subject: Re: [cgal-discuss] Intersect points of a Complex Polygon and a Flat Mesh
  • Date: Sat, 10 Feb 2007 22:44:46 +0100

Olumide a écrit :

Mariette Yvinec wrote:

Use the line_face_circulator of Triangulation_2 for each edge of the polygon


Thanks! Your hint was made clearer by the following document (page 14)
http://www.cgal.org/Events/Liama_Beijing_2007_documents/TriangulationsInCGAL.pdf

One more thing: I'd like to read more about the computational geometry of the line_face_circulator because I need to write a bit about whichever method I use. I've been reading chapter 2 of Computational Geometry by Mark de Berg et. al., and in particular, the Bentley-Ottman algorithm. Does the line_face_circulator use an algorithm similar to the one described in section 2.3 is on "computing the Overlay of two subdivisions."

Thank you

- Olumide

no, the line face circulator simply travels along a line in the triangulation




Archive powered by MHonArc 2.6.16.

Top of Page