Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Re: Voronoi Diagram and NaN

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Re: Voronoi Diagram and NaN


Chronological Thread 
  • From: "Sebastien Loriot (GeometryFactory)" <>
  • To:
  • Subject: Re: [cgal-discuss] Re: Voronoi Diagram and NaN
  • Date: Tue, 15 Nov 2011 12:38:02 +0100

memecs wrote:
Hi Sebastien,

I looked into draw_dual() but how do I reconstruct the bounded voronoi faces
then? It seems like I just get a list of segments out of it. Moreover I
think the code in draw_dual() and my code are pretty much equivalent.
No, please look at the file and function I indicated, this is very easy.

If you pass that struct to draw_dual

struct Voronoi_from_tri{
std::list<Ray_2> ray_list;
std::list<Line_2> line_list;
std::list<Segment_2> seg_list;

void operator<<(const Ray_2& p){ray_list.push_back(p);}
void operator<<(const Line_2& p){line_list.push_back(p);}
void operator<<(const Segment_2& p){seg_list.push_back(p);}
};

you'll see that you'll also get rays and lines.

If you are interested in the combinatorial description of facets,
then you are right this is not sufficient.

Sebastien.




--
View this message in context:
http://cgal-discuss.949826.n4.nabble.com/Voronoi-Diagram-and-NaN-tp4042568p4042622.html
Sent from the cgal-discuss mailing list archive at Nabble.com.





Archive powered by MHonArc 2.6.16.

Top of Page