Path: utzoo!utgpu!jarvis.csri.toronto.edu!mailrus!cs.utexas.edu!helios!photon!gordon
From: gordon@photon.tamu.edu (Dan Gordon)
Newsgroups: comp.graphics
Subject: Re: Combining two Polygons - Algorithm??
Message-ID: <4279@helios.TAMU.EDU>
Date: 19 Feb 90 21:10:31 GMT
References: <20549@netnews.upenn.edu>
Sender: usenet@helios.TAMU.EDU
Reply-To: gordon@photon.tamu.edu (Dan Gordon)
Distribution: usa
Organization: Texas A&M University, College Station, Texas
Lines: 6

In article <20549@netnews.upenn.edu> gururaj@eniac.seas.upenn.edu (Ravi Gururaj) writes:
>Request: Algorithm to combine two polygons.

Note that a very simple modification of the Weiler-Atherton clipping algorithm
yields an algorithm that combines the 2 input polygons. It can handle concave
polygons and holes as well.