A Hardware-Assisted Visibility-Ordering Algorithm with Applications to Volume Rendering

A Hardware-Assisted Visibility-Ordering Algorithm with Applications to Volume Rendering (2000)

Cached

Download Links

by Shankar Krishnan , Cláudio T. Silva , Bin Wei

Venue:	In Data Visualization (2001
Citations:	14 - 3 self

Versions

Version History

Metadata Version 3

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	A Hardware-Assisted Visibility-Ordering Algorithm with Applications to Volume Rendering	user correction - Legacy Corrections
AUTHOR NAME	Shankar Krishnan	user correction - Legacy Corrections
AUTHOR AFFIL	AT&T Labs-Research	user correction - Legacy Corrections
AUTHOR ADDR	180 Park Avenue; Florham Park, NJ 07932	user correction - Legacy Corrections
AUTHOR NAME	Cláudio T. Silva	user correction - Legacy Corrections
AUTHOR AFFIL	AT&T Labs-Research	user correction - Legacy Corrections
AUTHOR ADDR	180 Park Avenue; Florham Park, NJ 07932	user correction - Legacy Corrections
AUTHOR NAME	Bin Wei	user correction - Legacy Corrections
AUTHOR AFFIL	AT&T Labs-Research	user correction - Legacy Corrections
AUTHOR ADDR	180 Park Avenue; Florham Park, NJ 07932	user correction - Legacy Corrections
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...	user correction - Legacy Corrections
YEAR	2000	user correction - Legacy Corrections
VENUE	In Data Visualization (2001	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	233--242	INFERENCE
VOLUME	2001	INFERENCE
CITATIONS	27 found	ParsCit 1.0