Newsgroups: comp.robotics
Path: brunix!uunet!zaphod.mps.ohio-state.edu!magnus.acs.ohio-state.edu!usenet.ins.cwru.edu!agate!apple!constellation!uokmax.ecn.uoknor.edu!rwmurphr
From: rwmurphr@uokmax.ecn.uoknor.edu (Robert W Murphree)
Subject: Re: Looking for geometric algorithms on polygons
Message-ID: <1992Jul31.224807.3050@constellation.ecn.uoknor.edu>
Sender: usenet@constellation.ecn.uoknor.edu (Nets)
Organization: Engineering Computer Network, University of Oklahoma, Norman, OK, USA
References: <1992Jul29.073432.1096@aar.alcatel-alsthom.fr>
Date: Fri, 31 Jul 1992 22:48:07 GMT
Lines: 31

verdier@aar.alcatel-alsthom.fr (Franck Verdier) writes:


>Does anybody know where I can find C source code (on a ftp site) about
>geometric algorithms on polygons ?

>The polygons may be non convex, may have holes, may be only lines or
>points and even may be non connected (may consist of several disjoint
>polygons).

>The algorithms must perform the following geometric manipulations:
>	- symetric
>	- complementary
>	- union
>	- intersection
>	- geometric sum (Minkowski sum)

I wrote a C++ code that finds the intersection of convex polygons,
with no holes.

I would also be very interested in then above software.  You might
might try contacting Ronald Arkin at Georgia tech.   His model of
spatial uncertainty uses polygons.  He published his work long before I
began mine.

>===================================================================
>Franck du Verdier
>ALCATEL ALSTHOM RECHERCHE, Route de Nozay, 91460 Marcoussis, FRANCE
>Tel: 33 (1) 64 49 15 73  Fax: 33 (1) 64 49 06 95
>Email: verdier@aar.alcatel-alsthom.fr
>===================================================================
