Path: utzoo!attcan!telly!lethe!becker!bdb
From: bdb@becker.UUCP (Bruce Becker)
Newsgroups: comp.graphics
Subject: Re: Combining two Polygons - Algorithm??
Message-ID: <4916@becker.UUCP>
Date: 23 Feb 90 09:47:23 GMT
References: <20549@netnews.upenn.edu> <4279@helios.TAMU.EDU>
Reply-To: bdb@becker.UUCP (Bruce Becker)
Distribution: usa
Organization: G. T. S., Toronto, Ontario
Lines: 16

In article <4279@helios.TAMU.EDU> gordon@photon.tamu.edu (Dan Gordon) writes:
|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.

	Some details (or pointers to same)
	might well prove to be fascinating.

-- 
  (__)	 Bruce Becker	Toronto, Ontario
w \@@/	 Internet: bdb@becker.UUCP, bruce@gpu.utcs.toronto.edu
 `/v/-e	 UUCP: ...!uunet!mnetor!becker!bdb
_/  \_	 "They never tell you shit like this in high school!" - J. R. Dobbs