Path: utzoo!attcan!uunet!husc6!bbn!rochester!pt.cs.cmu.edu!maps.cs.cmu.edu!ych
From: ych@maps.cs.cmu.edu (Yuan Hsieh)
Newsgroups: comp.graphics
Subject: A question
Keywords: Polygon Cliping/Hidden lines
Message-ID: <1932@pt.cs.cmu.edu>
Date: 14 Jun 88 02:55:16 GMT
Sender: netnews@pt.cs.cmu.edu
Organization: Carnegie-Mellon University, CS/RI
Lines: 19

Is there a good algorithm to clip two polygons against each other?
In another word, if I put two polygons on top of one another, I don't want
to see the portions of the lower polygon covered by the upper one.  
Polygons are described by a list of points and I want to do the clipings 
before I display them.  So the standard hidden line removal method that 
sorts the polygons and then draw over them doesn't work.  If there are 
solutions for both convex and concave polygons, that'll be great!  Otherwise 
I can live with just the convex solution.

Pointers to published paper will suffice.

Please reply to ych@maps.cmu.cs.edu since I don't usually read this bboard.

Thanks.

-Y'


--