Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] How to find coordinates of Segment Voronoi Vertex

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] How to find coordinates of Segment Voronoi Vertex


Chronological Thread 
  • From: "Amit Pendharkar" <>
  • To:
  • Subject: Re: [cgal-discuss] How to find coordinates of Segment Voronoi Vertex
  • Date: Tue, 8 Apr 2008 16:39:44 -0500
  • Domainkey-signature: a=rsa-sha1; c=nofws; d=gmail.com; s=gamma; h=message-id:date:from:to:subject:in-reply-to:mime-version:content-type:references; b=WwRkbERcXMGRyksv9OyzvGDZoXLmLx5qWhDU7jP/D8OXorEcN9ZZi37v1hvL9bRGMMLJWYhTtIi6LzKUCwoKt+t46+RxHDsaq3VGGbX7Aki7MCAnEDTqp4+GUM7hQKfBb8QHFJWHOl/QKkwSST9cjzM2HHimwkrdXyAKSvQubtk=

Hi,

Thanks Daniel and Andreas for the valuable inputs.....Daniel's method works if the sites are points..........finally I could get the coordinates using Voronoi Adapter.

Serge,

sdg.dual() thing works for Delaunay_triangulation_2. It does not work for Segment_Delaunay_graph_2.

What you need to do is to go for the 'Voronoi Adapter'.

Read this chapter http://www.cgal.org/Manual/3.3/doc_html/cgal_manual/Voronoi_diagram_2/Chapter_main.html and also the corresponding manual.

Thus define a Voronoi_diagram_2 and Segment_Delaunay_graph_2 both.

Generate the Voronoi diagram first and get its dual by sdg = vd.dual();

You can then get all the voronoi vertices using Vertex_iterator, using for loop like for(vit = vd.vertices_begin(); vit != vd.vertices_end(); ++vit)

Please let me know if you have any problem.

Thanks & Regards,
Amit Pendharkar

On Tue, Apr 8, 2008 at 3:05 AM, Serge Rehbinder <> wrote:
Hi,

I also want to get the vertices Cartesian coordinates , I'm trying to put into pratice what M Duque wrote but when I write :

 CGAL::Object o = sdg.dual(eit2);

There's a compilation error  :

 error C2039: 'dual' : n'est pas membre de 'CGAL::Sdg2<Gt>'

which means 'dual' isn't member of 'CGAL::Sdg2<Gt>'
Can someone help me ?

Serge


2008/4/4, Andreas Fabri <>:

Hello,

note that CGAL offers an adapter for the Segment Delaunay graph
http://www.cgal.org/Pkg/VoronoiDiagramAdaptor2

andreas



Amit Pendharkar wrote:
Hi All,

I am using Segment Voronoi algorithm(Segment Delaunay Graph) to find the Voronoi edges.

I want to find out the 'voronoi vertices' i.e. those points where two or more voronoi edges meet.

I referred to the program /CGAL/examples/Segment_Delaunay_graph_2/sdg-voronoi-edges.cpp

It gives the edges according to       \                       /
       \         B         /
        \                  /
      C  -----------------  D
        /                 \
       /         A         \
      /                       \

i.e. it gives A, B, C & D.

My question is - how can I get the coordinates of the voronoi vertex formed due to ABC or BAD ?????? I want the cartesian x, y coordinates of those vertices.

This is kind of urgent. Can anybody please comment on this. All the inputs are highly appreciated.

Thanks & Regards,
Amit Pendharkar

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss





Archive powered by MHonArc 2.6.16.

Top of Page