DMCA
A Hardware-Assisted Visibility-Ordering Algorithm with Applications to Volume Rendering (2000)
Cached
Download Links
| Venue: | In Data Visualization (2001 |
| Citations: | 13 - 3 self |
BibTeX
@INPROCEEDINGS{Krishnan00ahardware-assisted,
author = {Shankar Krishnan and Cláudio T. Silva and Bin Wei},
title = {A Hardware-Assisted Visibility-Ordering Algorithm with Applications to Volume Rendering},
booktitle = {In Data Visualization (2001},
year = {2000},
pages = {233--242}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
. We propose a hardware-assisted visibility ordering algorithm. From a given viewpoint, a (back-to-front) visibility ordering of a set of objects is a partial order on the objects such that if object obstructs object , then precedes in the ordering. Such orderings are useful because they are the building blocks of other rendering algorithms such as direct volume rendering of unstructured grids. The traditional way to compute the visibility order is to build a set of visibility relations (e.g., ), and then run a topological sort on the set of relations to actually get the partial ordering. Our technique instead works by assigning a layer number to each primitive, which directly determines the visibility ordering. Objects that have the same layer number are independent, and can be placed anywhere with respect to each other. We use a simple technique which exploits a combination of the z- and stencil buffers to compute the layer number of each primitive...
Keyphrases
hardware-assisted visibility-ordering algorithm layer number partial ordering visibility relation object obstructs simple technique partial order hardware-assisted visibility traditional way topological sort visibility order unstructured grid visibility ordering direct volume rendering stencil buffer building block
