Re: [Algorithms] Simple algorithm for regular polygon union

[Eric H. <eri...@gm...>]

[Trying again, since I moved my email address and my reply got filtered
out.]

I don't know of a "stripped down" union library for this particular problem.

It sounds like you've already found some of these, but the best page I know
that lists a few 2D polygon union packages is the one linked from Jeremy's:
http://www.cs.man.ac.uk/~toby/alan/software/links.html. Eberly's had the
least restrictive licensing, though wasn't particularly efficient (but gave
solid results - he uses exact integer arithmetic). I've used this package in
shipping software, it works well. I found most of the other packages listed
had "For non-commercial use only" or other limitations, which was annoying.
The Eberly link from the GPC page is broken, and you'll have to dig on
Eberly's site a bit for the code:

Classes here, and paper on his algorithm at the bottom:
http://www.geometrictools.com/LibFoundation/ComputationalGeometry/ComputationalGeometry.html

Actual code here:
http://www.geometrictools.com/SampleFoundation/Boolean2D/Boolean2D.html

Eric

On Tue, May 5, 2009 at 1:48 PM, Jeremy <jsw...@gm...> wrote:

> Something like this? http://www.cs.man.ac.uk/~toby/alan/software/gpc.html
>
>
>
> On Tue, May 5, 2009 at 9:30 AM, Jose Marin <jos...@ya...>wrote:
>
>>
>> Hi,
>>
>> I have found some libraries in the net to perform polygon operations, but
>> I need a very simple one: union of closed convex polygons.
>>
>