Path: utzoo!news-server.csri.toronto.edu!cs.utexas.edu!sdd.hp.com!think.com!linus!agate!ucbvax!dog.ee.lbl.gov!nosc!halibut.nosc.mil!dwu
From: dwu@halibut.nosc.mil (Daniel Wu)
Newsgroups: comp.graphics
Subject: Polygon clipping routines
Summary: Is there an implementation of Weiler polygon clipping out there?
Keywords: polygon clipping Weiler
Message-ID: <3636@nosc.NOSC.MIL>
Date: 7 Mar 91 16:07:58 GMT
Sender: nobody@nosc.NOSC.MIL
Followup-To: comp.graphics
Organization: Naval Ocean Systems Center, San Diego
Lines: 16


I am trying to implement some polygon clipping routines.  Chapter 14 in
Foley, Van Damme, et al. has several sources. The one that seems most 
promising is the Weiler polygon clipping routine.  Before I plunge ahead and 
try to implement this, I was wondering if anyone else has done this already 
or if there is some PD code which I can study.

The Weiler algorithm actually does more than clip polygons, it performs 
boolean operations between polygons such as AND, OR, XOR, NEG, etc so that 
one can find their intersection, union, complement, and symmetric difference.

I'd appreciate any information anyone might offer.  I need to implement 
this FAST.

Daniel
dwu@halibut.nosc.mil