Path: utzoo!censor!geac!torsqnt!jarvis.csri.toronto.edu!rutgers!cs.utexas.edu!titan!elrond
From: elrond@titan.tsd.arlut.utexas.edu (Brad Hlista)
Newsgroups: comp.graphics
Subject: intersecting regions
Keywords: finding the intersection
Message-ID: <610@titan.tsd.arlut.utexas.edu>
Date: 25 Feb 90 06:20:48 GMT
Organization: Applied Research Labs, University of Texas; Austin, IX
Lines: 10

I have two regions A and B defined by four vertices.  Letting A be the 
boundary of the screen, I am looking for a fast clipping routine to find the 
new vertices of A intersect B. I have come up with something but the number
of tests I make to check the new points continue to grow. I should mention that
the vertices of B can be anywhere in the cartesian plane and that none of the
lines from the vertices intersect other than at the vertices.  Any help would
be appreciated.

	Brad Hlista
	elrond@titan.tsd.arlut.utexas.edu