The DOI matches its Crossref record; 25 of the 25 references it cites were found in a registry or an index.
Efficient ray tracing of volume data
Open accessAbstract
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.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · Proceedings of the 14th annual conference on Computer graphics and interactive techniques · doi:10.1145/37401.37422 · Cited by 10,104
Marching cubes: A high resolution 3D surface construction algorithm
Lorensen, W. E., & Cline, H. E. (1987) · ACM SIGGRAPH Computer Graphics · doi:10.1145/37402.37422 · Cited by 8,647
Display of surfaces from volume data
Levoy, M. (1988) · IEEE Computer Graphics and Applications · doi:10.1109/38.511 · Cited by 2,446
Self-citationAn improved illumination model for shaded display
Whitted, T. (1980) · Communications of the ACM · doi:10.1145/358876.358882 · Cited by 1,768
Drebin, R. A., Carpenter, L., & Hanrahan, P. (1988) · ACM SIGGRAPH Computer Graphics · doi:10.1145/378456.378484 · Cited by 1,612
Geometric modeling using octree encoding
Meagher, D. (1982) · Computer Graphics and Image Processing · doi:10.1016/0146-664x(82)90104-6 · Cited by 1,266
Porter, T., & Duff, T. (1984) · Proceedings of the 11th annual conference on Computer graphics and interactive techniques · doi:10.1145/800031.808606 · Cited by 1,164
Stochastic sampling in computer graphics
Cook, R. L. (1986) · ACM Transactions on Graphics · doi:10.1145/7529.8927 · Cited by 982
Optimal surface reconstruction from planar contours
Fuchs, H., Kedem, Z. M., & Uselton, S. P. (1977) · Communications of the ACM · doi:10.1145/359842.359846 · Cited by 798
Porter, T., & Duff, T. (1984) · ACM SIGGRAPH Computer Graphics · doi:10.1145/964965.808606 · Cited by 727
Cited by
NeRF: Representing Scenes as Neural Radiance Fields for View Synthesis
Mildenhall, B., Srinivasan, P. P., Tancik, M., Barron, J. T., Ramamoorthi, R., & Ng, R. (2020) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-58452-8_24 · Cited by 5,351
Three-dimensional ultrasound imaging
Fenster, A., Downey, D. B., & Cardinal, H. N. (2001) · Physics in Medicine and Biology · doi:10.1088/0031-9155/46/5/201 · Cited by 812
Interactive segmentation of image volumes with Live Surface
Armstrong, C. J., Price, B. L., & Barrett, W. A. (2007) · Computers & Graphics · doi:10.1016/j.cag.2006.11.015 · Cited by 53
Metadata
- Authors
- Levoy, M.
- Venue
- ACM Transactions on Graphics
- Published
- 1990-07
- Volume
- 9
- Issue
- 3
- Pages
- 245-261
- ISSN
- 0730-0301 (ISSN-L)
- 1557-7368
- OpenAlex
- W2126521141
- Cited by
- 991
- References
- 25
- FWCI
- 29.57
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Efficient ray tracing of volume data. https://app.cochat.ai/papers/10.1145/78964.78965
- The paper
- Levoy, M. (1990). Efficient ray tracing of volume data. ACM Transactions on Graphics. https://doi.org/10.1145/78964.78965
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.
