Student or educator? Sign up with your school email and get 6 months of Pro free.
Cited by 375

The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.

Hierarchical splatting: a progressive refinement algorithm for volume rendering

Laur, David, Hanrahan, Pat·1991·Proceedings of the 18th annual conference on Computer graphics and interactive techniques

Abstract

This paper presents a progressive refinement algorithm for volume rendering which uses a pyramidal volume representation. Besides storing average values, the pyramid stores estimated error, so an octtree can be fit to the pyramid given a user-supplied precision. This octtree is then drawn using a set of splats, or footprints, each scaled to match the size of the projection of a cell. The splats themselves are approximated with RGBA Gouraud-shaded polygons, so that they can be drawn efficiently on modern graphics workstations. The result is a real-time rendering algorithm suitable for interactive applications.

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.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/122718.122748

Cites

6 of 6 references verified0 citation errors · 0 not checkable

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.

A few free checks a day · papers already verified open instantly · results are public

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

Show all 6 references

Cited by

See all 375

Metadata

Authors
Laur, D., & Hanrahan, P.
Venue
Proceedings of the 18th annual conference on Computer graphics and interactive techniques
Publisher
ACM
Published
1991-07
Pages
285-288
OpenAlex
W2100087065
Cited by
375
References
6
FWCI
11.39
Type
conference paper
Language
en
Open access
closed

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: Hierarchical splatting: a progressive refinement algorithm for volume rendering. https://app.cochat.ai/papers/10.1145/122718.122748
The paper
Laur, D., & Hanrahan, P. (1991). Hierarchical splatting: a progressive refinement algorithm for volume rendering. Proceedings of the 18th annual conference on Computer graphics and interactive techniques. https://doi.org/10.1145/122718.122748

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.