Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!seismo!uunet!steinmetz!philabs!pwa-b!rochelle
From: rochelle@pwa-b.UUCP (Bob LaRochelle)
Newsgroups: comp.graphics
Subject: Newell's Hidden Surface Removal Algorithm
Message-ID: <109@pwa-b.UUCP>
Date: Tue, 9-Jun-87 16:03:56 EDT
Article-I.D.: pwa-b.109
Posted: Tue Jun  9 16:03:56 1987
Date-Received: Sat, 20-Jun-87 03:48:23 EDT
Organization: Pratt & Whitney Aircraft, E. Hartford, CT
Lines: 12
Keywords: hidden surfaces, polygons, graphics


          I am currently implementing Newell's algorithm for hidden
surface removal. I originally thought that since the polygons were
non-intersecting that polygon splitting would be unecessary. It works
OK for most geometries but it seems that face splitting logic is needed.
If anyone out there has already implemented this procedure and can post
source code ( in any language ) it would be greatly appreciated.


                        Thanks in advance 
						Robert LaRochelle
						Pratt & Whitney