Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.1 6/24/83; site srcsip.UUCP
Path: utzoo!watmath!clyde!burl!ulysses!mhuxr!mhuxn!ihnp4!stolaf!umn-cs!mmm!srcsip!meier
From: meier@srcsip.UUCP (Christopher M. Meier)
Newsgroups: net.graphics
Subject: Re: Polygon-polygon clipping
Message-ID: <2215@srcsip.UUCP>
Date: Mon, 18-Nov-85 19:46:54 EST
Article-I.D.: srcsip.2215
Posted: Mon Nov 18 19:46:54 1985
Date-Received: Thu, 21-Nov-85 05:31:55 EST
References: <255@h.cs.cmu.edu> <177@octopus.UUCP> <958@turtlevax.UUCP>
Reply-To: meier@srcsip.UUCP (Christopher M. Meier)
Organization: Honeywell SRC (SIP), Mpls MN
Lines: 27
Summary: 

In article <958@turtlevax.UUCP> ken@turtlevax.UUCP (Ken Turkowski) writes:
>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
If memory serves correct, the Weiler-Atherton Algorithm is in
the Foley & Van Dam book on Graphics.
-- 
   Christopher Meier  MN17-2357        Honeywell, Inc. Systems & Research Center
        2600 Ridgeway Pky.	               Signal & Image Processing
        Mpls, MN  55413		          Artificial Intelligence Technology
{philabs,ihnp4!umn-cs}!srcsip!meier