Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site browngr.UUCP
Path: utzoo!linus!philabs!cmcl2!seismo!harvard!talcott!wjh12!foxvax1!brunix!browngr!wbt
From: wbt@browngr.UUCP (Ben Trumbore)
Newsgroups: net.graphics
Subject: Articles about CSG algorithms
Message-ID: <10249@browngr.UUCP>
Date: Sun, 28-Apr-85 15:42:05 EDT
Article-I.D.: browngr.10249
Posted: Sun Apr 28 15:42:05 1985
Date-Received: Tue, 30-Apr-85 03:07:37 EDT
Reply-To: wbt@browngr.UUCP (Ben Trumbore)
Distribution: net
Organization: Brown University Computer Science
Lines: 13

Expires:
References:
Sender:
Keywords:

I have been looking for papers which describe in some detail an algorithm
for performing a Constructive Solid Geometry operation on two polygonal
objects.  All the papers I have found are very general, and vague about
methods of implementation.  Efficiency isn't a primary concern; rather
I need a complete algorithm which handles co-planar faces, and the many
other special cases which are bound to arise.  If you know of any papers
on this subject, I would appreciate hearing from you.


			Ben Trumbore, Brown Computer Science 
			{allegra,ihnp4,decvax}!brunix!wbt 
			wbt.brown@csnet-relay
			wbt@browncs.bitnet