Boost logo

Boost :

Subject: Re: [boost] GSoC2010 Sweepline Algorithm
From: Andriy Sydorchuk (sydorchuk.andriy_at_[hidden])
Date: 2010-04-08 17:14:41


>
> I see now that your element is actually a bisector of two sites, the moving
> point at which two parabolas intersect that traces line segments of the
> veronoi diagram as the sweepline advances.

Yes, you are right. Thanks for all the tips. I've already written my
proposal.

If you implement Medial Axis with sweepline that works on non-convex
> polygons with holes you have implmented an algorithm that can also handle
> multiple non-overlapping polygons.

Ok, I see. At the moment I am looking for docs about Medial Axis sweepline
algo implementation. Maybe you have some references?

Best,
Andrii Sydorchuk


Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk