DMCA
Efficient ray tracing of volume data (1990)
Cached
Download Links
- [www.cs.stevens.edu]
- [web.cs.ucdavis.edu]
- DBLP
Other Repositories/Bibliography
| Venue: | ACM Transactions on Graphics |
| Citations: | 391 - 5 self |
BibTeX
@ARTICLE{Levoy90efficientray,
author = {Marc Levoy},
title = {Efficient ray tracing of volume data},
journal = {ACM Transactions on Graphics},
year = {1990},
volume = {9},
pages = {245--261}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
Volume rendering is a technique for visualizing sampled scalar or vector fields of three spatial dimensions without fitting geometric primitives to the data. A subset of these techniques generates images by computing 2-D projections of a colored semitransparent volume, where the color and opacity at each point are derived from the data using local operators. Since all voxels participate in the generation of each image, rendering time grows linearly with the size of the dataset. This paper presents a front-to-back image-order volume-rendering algorithm and discusses two techniques for improving its performance. The first technique employs a pyramid of binary volumes to encode spatial coherence present in the data, and the second technique uses an opacity threshold to adaptively terminate ray tracing. Although the actual time saved depends on the data, speedups of an order of magnitude have been observed for datasets of useful size and complexity. Examples from two applications are given: medical imaging and molecular graphics.
Keyphrases
efficient ray tracing volume data technique generates image useful size first technique spatial coherence present vector field time grows molecular graphic local operator second technique front-to-back image-order volume-rendering algorithm medical imaging volume rendering spatial dimension binary volume 2-d projection actual time geometric primitive colored semitransparent volume opacity threshold
