dwu@halibut.nosc.mil (Daniel Wu) (03/08/91)
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