The prioritized-layered projection algorithm for visible set estimation

James T. Klosowski, Claudio T. Suva

Research output: Contribution to journalArticle

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 solidityva\ue 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.

Original languageEnglish (US)
Pages (from-to)108-123
Number of pages16
JournalIEEE Transactions on Visualization and Computer Graphics
Volume6
Issue number2
DOIs
StatePublished - Apr 2000

Keywords

  • Occlusion culling
  • Spatial tessellation
  • Time-critical rendering
  • Visibility
  • Visible set

ASJC Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Software

Cite this

The prioritized-layered projection algorithm for visible set estimation. / Klosowski, James T.; Suva, Claudio T.

In: IEEE Transactions on Visualization and Computer Graphics, Vol. 6, No. 2, 04.2000, p. 108-123.

Research output: Contribution to journalArticle

@article{06bba71248bd45aab9295cdde51e049b,
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 solidityva\ue 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.",
keywords = "Occlusion culling, Spatial tessellation, Time-critical rendering, Visibility, Visible set",
author = "Klosowski, {James T.} and Suva, {Claudio T.}",
year = "2000",
month = "4",
doi = "10.1109/2945.856993",
language = "English (US)",
volume = "6",
pages = "108--123",
journal = "IEEE Transactions on Visualization and Computer Graphics",
issn = "1077-2626",
publisher = "IEEE Computer Society",
number = "2",

}

TY - JOUR

T1 - The prioritized-layered projection algorithm for visible set estimation

AU - Klosowski, James T.

AU - Suva, Claudio T.

PY - 2000/4

Y1 - 2000/4

N2 - 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 solidityva\ue 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.

AB - 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 solidityva\ue 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.

KW - Occlusion culling

KW - Spatial tessellation

KW - Time-critical rendering

KW - Visibility

KW - Visible set

UR - http://www.scopus.com/inward/record.url?scp=0034172313&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0034172313&partnerID=8YFLogxK

U2 - 10.1109/2945.856993

DO - 10.1109/2945.856993

M3 - Article

VL - 6

SP - 108

EP - 123

JO - IEEE Transactions on Visualization and Computer Graphics

JF - IEEE Transactions on Visualization and Computer Graphics

SN - 1077-2626

IS - 2

ER -