Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] In-order traversal of Delaunay edges corresponding to unbounded Voronoi edges

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] In-order traversal of Delaunay edges corresponding to unbounded Voronoi edges


Chronological Thread 
  • From: Martin Uhrin <>
  • To:
  • Subject: Re: [cgal-discuss] In-order traversal of Delaunay edges corresponding to unbounded Voronoi edges
  • Date: Fri, 15 Nov 2013 07:14:36 -0800 (PST)

Thanks Monique.

I tried this approach. Or one that I think is equivalent:

delaunay.incident_edges(delaunay.infinite_vertex());

but as you said, this produces the convex hull of the triangulation. This
would give me edge 1-3, however I believe the dual of the ray that passes
through the label b is in fact edge 1-2 which is the one I want, followed by
edge 2-3.

Any suggestions on how to get these (and crucially, in order)?



--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/In-order-traversal-of-Delaunay-edges-corresponding-to-unbounded-Voronoi-edges-tp4658419p4658422.html
Sent from the cgal-discuss mailing list archive at Nabble.com.



Archive powered by MHonArc 2.6.18.

Top of Page