Subject: Re: [boost] [Review Request] Inclusion of the Boost.Polygon Voronoi Library
From: Jeremiah Willcock (jewillco_at_[hidden])
Date: 2012-05-22 16:56:17
On Tue, 22 May 2012, Phil Endecott wrote:
> Andrii Sydorchuk wrote:
>> On Mon, May 21, 2012 at 9:03 PM, Phil Endecott wrote:
>>> I can now refer to edges and vertices using Boost.Graph's
>>> vertex_descriptor and edge_descriptor, and lookup the CGVertex and CGEdge
>>> objects using operator:
>>> ContourGraph g;
>>> ContourGraph::vertex_descriptor v = g.add_vertex_near_vertex(....);
>>> g[v].alt = 42;
>> I would look closer at this approach to investigate memory/performance
>> overheads of such a design.
>> Anyway providing Boost.Graph interface for Voronoi diagram data structure
>> is something that could be added within the future releases.
> It would be an interesting test of the Boost.Graph concepts to see if they
> fit a half-edge or dart or similar planar graph representation. Maybe some
> Boost.Graph experts could comment on this.
You might want to look at how CGAL does this mapping; I think they use
concepts that are slightly different natively, then have wrappers that
model Boost.Graph concepts. I'm not familiar with Boost.Graph's own
planar graph code.
-- Jeremiah Willcock
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk