sundar@hermes.ai.mit.edu (Sundar Narasimhan) (08/07/88)
Hi: I have a couple of questions regarding the Weiler and Atherton algorithm for hidden surface removal by polygon area sorting. (based on their paper in Computer Graphics Vol 11, No 2, '77). a. They mention that care must be taken in handling special cases in their clipper (i.e. two segments that intersect at the endpoints of one of the segments, two overlapping segments etc..) but give no details of how this can actually be done. Is this info published somewhere? Is there an updated version of this paper? b. They also mention something called polygon consolidation in their section on extensions. Has anyone implemented this? If so, how does one make the algorithm work with surface detail polygons in an object with holes. I dont read this group so please respond to sundar@wheaties.ai.mit.edu. An informal survey question -- respond if you wish to: What is your favourite classic hidden surface algorithm? and why?