A simple output-sensitive algorithm for hidden surface removal

Abstract

We derive a simple output-sensitive algorithm for hidden surfaceremoval in a collection of ntriangles in space for which a 1992 depth order is known. Ifk is the combinatorial complexity ofthe output visibility map, the methodruns in time [Formula Omitted]. The method is extended to work for other classes ofobjects as well, sometimes with even improved time bounds. For example,we obtain an algorithm that performs hidden surface removal forn (nonintersecting) balls in time[formula omitted]. © 1992, ACM. All rights reserved.