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

The DOI matches its Crossref record.

A rapid hierarchical radiosity algorithm

Open access
Hanrahan, Pat, Salzman, David, Aupperle, Larry·1991·ACM SIGGRAPH Computer Graphics

Abstract

This paper presents a rapid hierarchical radiosity algorithm for illuminating scenes containing large polygonal patches. The algorithm constructs a hierarchical representation of the form factor matrix by adaptively subdividing patches into subpatches according to a user-supplied error bound. The algorithm guarantees that all form factors are calculated to the same precision, removing many common image artifacts due to inaccurate form factors. More importantly, the algorithm decomposes the form factor matrix into at most O(n ) blocks (where n is the number of elements). Previous radiosity algorithms represented the element-to-element transport interactions with n 2 form factors. Visibility algorithms are given that work well with this approach. Standard techniques for shooting and gathering can be used with the hierarchical representation to solve for equilibrium radiosities, but we also discuss using a brightness-weighted error criteria, in conjunction with multigridding, to even more rapidly progressively refine the image.

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/127719.122740

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.

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

Cited by

See all 250

Metadata

Authors
Hanrahan, P., Salzman, D., & Aupperle, L.
Venue
ACM SIGGRAPH Computer Graphics
Published
1991-07
Volume
25
Issue
4
Pages
197-206
ISSN
0097-8930 (ISSN-L)
OpenAlex
W3004728147
Cited by
250
References
0
FWCI
17.11
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: A rapid hierarchical radiosity algorithm. https://app.cochat.ai/papers/10.1145/127719.122740
The paper
Hanrahan, P., Salzman, D., & Aupperle, L. (1991). A rapid hierarchical radiosity algorithm. ACM SIGGRAPH Computer Graphics. https://doi.org/10.1145/127719.122740

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.