- From: "龚咏喜" <>
- To:
- Subject: Re: Re: [cgal-discuss] voronoi of polygon s
- Date: Fri, 25 Jan 2008 21:58:21 +0800 (CST)
I am wondering if CGAL support Voronoi diagram for points and line segments, and conic polygons clipping. If it does, I think you can implements voronoi for polygons by youself in a very simple way.
From: "Mahmood Naderan" <>
To:
Date: Fri, 25 Jan 2008 17:43:58 +0800 (CST)
Subject: Re: [cgal-discuss] voronoi of polygons
> >I think CGAL can generate Voronoi diagrams for polygons with equal weights. See the CGAL User and Reference Manual. I don't remember which >chapter discuss it. > > So as Menelaos said, there isn't... > Thanks, > > ------------------- > Mahmood Naderan > http://ce.sharif.edu/~m_naderan > > > > Compose Email > > Add to Contacts > > > > > ----- Original Message ---- > From: 龚咏喜 > To: > Sent: Friday, January 25, 2008 11:32:59 AM > Subject: Re: [cgal-discuss] voronoi of polygons > > > hi! > I think CGAL can generate Voronoi diagrams for polygons with equal weights. See the CGAL User and Reference Manual. I don't remember which chapter discuss it. > However, Multiple Weighted Voronoi Diagrams for polygons have not been supported by CGAL to my knowdge for edges for MWVDs are paths consisting of conic curves, for examples, line segments(if we take it as a special case of conics), circle segments, ellipse segments, parabola segments and hyperbola segments, bounded conics. > I have ever looked for supports in CGAL for MWVDs for points, line segments and polygons, but failed. So I developed a vector based library to generate MWVDs for points, line segments and polygons. The basic of MWVDs for points, line segments and polygons is the clipping algorithm for conic polygons. It took me several months to implement it in C#. I am happy that it works very well. > If you know any library for MWVDs for points, line segments and polygons, please let me know. I want to compare different algorithms. > Thanks. > > > > > > > > -------原邮件内容如下------- > 发件人∶"Mahmood Naderan" > 收件人∶"CGAL discuss" > 日期∶Fri, 25 Jan 2008 15:42:54 +0800 (CST) > 主题∶[cgal-discuss] voronoi of polygons > > > > > > > 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 ::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 > > > > > > 美利山开盘3000人抢购!440套售罄,加推300套17号开始登记! > > > ____________________________________________________________________________________ > 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 >
美利山开盘3000人抢购!440套售罄,加推300套17号开始登记!
Archive powered by MHonArc 2.6.16.