Issue No. 02 - April-June (2000 vol. 6)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/2945.856993
<p><b>Abstract</b>—<it>Prioritized-Layered Projection</it> (PLP) is a technique for fast rendering of high depth complexity scenes. It works by <it>estimating</it> the visible polygons of a scene from a given viewpoint incrementally, one primitive at a time. It is not a conservative technique, instead PLP is suitable for the computation of partially correct images for use as part of time-critical rendering systems. From a very high level, PLP amounts to a modification of a simple view-frustum culling algorithm, however, it requires the computation of a special occupancy-based tessellation and the assignment to each cell of the tessellation a <it>solidity</it> value, which is used to compute a special ordering on how primitives get projected. In this paper, we detail the PLP algorithm, its main components, and implementation. We also provide experimental evidence of its performance, including results on two types of spatial tessellation (using octree- and Delaunay-based tessellations), and several datasets. We also discuss several extensions of our technique.</p>
Visibility, time-critical rendering, occlusion culling, visible set, spatial tessellation.
C. T. Silva and J. T. Klosowski, "The Prioritized-Layered Projection Algorithm for Visible Set Estimation," in IEEE Transactions on Visualization & Computer Graphics, vol. 6, no. , pp. 108-123, 2000.