Subject: CGAL users discussion list
List archive
- From: Menelaos Karavelas <>
- To:
- Subject: Re: [cgal-discuss] voronoi of polygons
- Date: Fri, 25 Jan 2008 10:06:02 +0200
The Voronoi diagram package is just an adaptor. Currently it adapts the Delaunay graphs (dual of Voronoi diagrams) for the regular triangulation, Delaunay triangulation, Apollonius graph and segment Delaunay graph. There is no immediate way to compute the Voronoi diagram for a set of polygons.
- m.
On 25 Jan 2008, at 09:42, Mahmood Naderan wrote:
Hello,
I want to know if Voronoi package is able to compute the voronoi diagram of a set of polygons.
Also what does "CGAL::Voronoi_diagram_2<DG,AT,AP>::Vertex" do? Is it for storing voronoi vertices (points that are intersection of edges)?
Thanks,
-------------------
Mahmood Naderan
http://ce.sharif.edu/~m_naderan
______________________________________________________________________ ______________
Looking for last minute shopping deals?
Find them fast with Yahoo! Search. http://tools.search.yahoo.com/ newsearch/category.php?category=shopping
--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss
- voronoi of polygons, Mahmood Naderan, 01/25/2008
- Re: [cgal-discuss] voronoi of polygons, 龚咏喜, 01/25/2008
- Re: [cgal-discuss] voronoi of polygons, Menelaos Karavelas, 01/25/2008
Archive powered by MHonArc 2.6.16.