Share Email Print

Proceedings Paper

Data-dependent gradient quantization scheme for the acceleration of volume rendering
Author(s): Peer-Timo Bremer; Oliver Kreylos; Bernd Hamann
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Volume rendering requires the use of gradient information used as surface normal information, for application of lighting models. However, for interactive applications on- the-fly calculation of gradients is too slow. The common solution to this problem is to quantize gradients of trivariate scalar fields and pre-compute a look-up table prior to the application of a volume rendering method. A number of techniques have been proposed for the quantization of normal vectors, but few have been applied to or adapted for the purpose of volume rendering. We describe a new data- dependent method to quantize gradients using an even number of vectors in a table. The quantization scheme we use is based on a tessellation of the unit sphere. This tessellation represents an 'optimally' distributed set of unit normal vectors. Staring with a random tessellation, we optimize the size and distribution of the tiles with a simulated annealing approach.

Paper Details

Date Published: 3 May 2001
PDF: 11 pages
Proc. SPIE 4302, Visual Data Exploration and Analysis VIII, (3 May 2001); doi: 10.1117/12.424917
Show Author Affiliations
Peer-Timo Bremer, Univ. of California/Davis (United States)
Oliver Kreylos, Univ. of California/Davis (United States)
Bernd Hamann, Univ. of California/Davis (United States)

Published in SPIE Proceedings Vol. 4302:
Visual Data Exploration and Analysis VIII
Robert F. Erbacher; Philip C. Chen; Jonathan C. Roberts; Craig M. Wittenbrink; Matti Grohn, Editor(s)

© SPIE. Terms of Use
Back to Top