Received: from sunee.waterloo.edu by karazm.math.UH.EDU with SMTP id AA21658
  (5.65c/IDA-1.4.4 for <glove-list@karazm.math.uh.edu>); Tue, 22 Oct 1991 15:30:04 -0500
Received: by sunee.waterloo.edu
	id <AA26957>; Tue, 22 Oct 91 16:25:54 -0400
From: Bernie Roehl <broehl@sunee.waterloo.edu>
Message-Id: <9110222025.AA26957@sunee.waterloo.edu>
Subject: clippin
To: glove-list@karazm.math.uh.edu
Date: Tue, 22 Oct 91 16:25:52 EDT
X-Mailer: ELM [version 2.3 PL11]
> Now I am aware that the conversion from an object tree to a poly list
> (hopefully ordered in some way) is expensive and the BSP and ASP help
> here, but there are other ways to optimize this.  I am proposing a
> simple set of "enclosing" points for each object that would control
> the sorting, masking and clipping of each object.  This would reduce
> computations by 90% during list transversal.  Let me know what you think.

Sounds like a good idea; assign each object a bounding box and then clip
by objects before even worrying about polygons.

-- 
	Bernie Roehl, University of Waterloo Electrical Engineering Dept
	Mail: broehl@sunee.waterloo.edu OR broehl@sunee.UWaterloo.ca
	BangPath: watmath!sunee!broehl
	Voice:  (519) 885-1211 x 2607 [work]