Paper Info
Title
The Prioritized-Layered Projection Algorithm for Visible Set Estimation
Abstract
Prioritized-Layered Projection (PLP) is a technique for fast rendering of high depth complexity scenes. It works by estimating 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 solidity 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.
Year
DOI
Venue
2000
10.1109/2945.856993
IEEE Trans. Vis. Comput. Graph.
Keywords
DocType
Volume
visible set,index terms visibility culling,time-critical rendering system,plp amount,prioritized-layered projection algorithm,fast rendering,special occupancy-based tessellation,spatial tessellation,plp algorithm,approximate visibility,visible set estimation,delaunay-based tessellations,time-critical rendering,high depth complexity scene,occlusion culling,conservative technique,high level,indexing terms,computational geometry,visibility,computational complexity,rendering system,mesh generation
Journal
6
Issue
ISSN
Citations 
2
1077-2626
36
PageRank 
References 
Authors
1.49
18
2
Name
Order
Citations
PageRank
James T. Klosowski1114567.59
Cláudio T. Silva25054290.90