Photo
James T. Klosowski

The Prioritized-Layered Projection Algorithm
for Visible Set Estimation

J. T. Klosowski and C. T. Silva
IEEE Transactions on Visualization and Computer Graphics
6(2), pages 108-123, June 2000

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.

Index Terms: visibility culling, approximate visibility, time-critical rendering, occlusion culling, visible set, spatial tessellation


Download

IEEE - Copyright © 2000 by IEEE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit. To copy otherwise, to republish, to post of servers, or to redistribute to lists, requires prior specific permission and/or a fee.

Please note that the version of the paper printed in the April-June 2000 issue of IEEE TVCG contains an error in the reproduction of Figures 11(a) and (b). This version of the paper contains the correct images.

plp_tvcg.pdf (4673260 bytes)