Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.3 4.3bsd-beta 6/6/85; site turtlevax.UUCP
Path: utzoo!watmath!clyde!cbosgd!ihnp4!mhuxn!mhuxr!ulysses!allegra!oliveb!Glacier!decwrl!turtlevax!ken
From: ken@turtlevax.UUCP (Ken Turkowski)
Newsgroups: net.graphics
Subject: Re: Polygon-polygon clipping
Message-ID: <958@turtlevax.UUCP>
Date: Wed, 13-Nov-85 01:31:26 EST
Article-I.D.: turtleva.958
Posted: Wed Nov 13 01:31:26 1985
Date-Received: Fri, 15-Nov-85 04:37:35 EST
References: <255@h.cs.cmu.edu> <177@octopus.UUCP>
Reply-To: ken@turtlevax.UUCP (Ken Turkowski)
Organization: CIMLINC, Inc. @ Menlo Park, CA
Lines: 23

In article <177@octopus.UUCP> pete@octopus.UUCP (Pete Holzmann) writes:
>If anybody has an algorithm on clipping a polygon to a polygon, I'd like
>the reference also. Thanks!

You should take a look at the Weiler-Atherton Algorithm.

Weiler, Kevin and Atherton, Peter, "Hidden Surface Removal Using
Polygon Area Sorting", Computer Graphics, Vol. 11, pp. 214-222, 1977
(Proc. SIGGRAPH '77)

Weiler, Kevin, "Hidden Surface Removal Using Polygon Area Sorting",
Masters Thesis, Program of Computer Graphics, Cornell University,
January 1978

Weiler, Kevin, "Polygon Comparison Using a Graph Representation",
Computer Graphics, Vol. 14, pp. 10-18, 1980 (Proc. SIGGRAPH '80)

Rogers, David F., 259-264, Procedural Elements for Computer Graphics,
McGraw-Hill 1985, pp. 179-185
-- 
Ken Turkowski @ CIMLINC (formerly CADLINC), Menlo Park, CA
UUCP: {amd,decwrl,hplabs,seismo,spar}!turtlevax!ken
ARPA: turtlevax!ken@DECWRL.DEC.COM