The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Visibility culling using hierarchical occlusion maps
Open accessAbstract
We present hierarchical occlusion maps (HOM) for visibility culling on complex models with high depth complexity.The culling algorithm uses an object space bounding volume hierarchy and a hierarchy of image space occlusion maps.Occlusion maps represent the aggregate of projections of the occluders onto the image plane.For each frame, the algorithm selects a small set of objects from the model as occluders and renders them to form an initial occlusion map, from which a hierarchy of occlusion maps is built.The occlusion maps are used to cull away a portion of the model not visible from the current viewpoint.The algorithm is applicable to all models and makes no assumptions about the size, shape, or type of occluders.It supports approximate culling in which small holes in or among occluders can be ignored.The algorithm has been implemented on current graphics systems and has been applied to large models composed of hundreds of thousands of polygons.In practice, it achieves significant speedup in interactive walkthroughs of models with high depth complexity.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Computer graphics: principles and practice
(2014) · Choice Reviews Online · doi:10.5860/choice.51-2713 · Cited by 4,651
Fast wavelet transforms and numerical algorithms I
Beylkin, G., Coifman, R., & Rokhlin, V. (1991) · Communications on Pure and Applied Mathematics · doi:10.1002/cpa.3160440202 · Cited by 1,770
Computer graphics — principles and practice
Leitáo, V. (1992) · Advances in Engineering Software · doi:10.1016/0965-9978(92)90087-v · Cited by 820
Hierarchical geometric models for visible surface algorithms
Clark, J. H. (1976) · Communications of the ACM · doi:10.1145/360349.360354 · Cited by 778
A subdivision algorithm for computer display of curved surfaces.
Catmull, E. E. (1974) · Cited by 715
Williams, L. (1983) · Proceedings of the 10th annual conference on Computer graphics and interactive techniques · doi:10.1145/800059.801126 · Cited by 715
A hierarchical data structure for picture processing
Tanimoto, S., & Pavlidis, T. (1975) · Computer Graphics and Image Processing · doi:10.1016/s0146-664x(75)80003-7 · Cited by 481
Williams, L. (1983) · ACM SIGGRAPH Computer Graphics · doi:10.1145/964967.801126 · Cited by 308
Talisman: commodity realtime 3D graphics for the PC
Torborg, J., & Kajiya, J. T. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237274 · Cited by 229
Accelerated occlusion culling using shadow frusta
Hudson, T., Manocha, D., Cohen, J., Lin, M. C., Hoff, K., & Zhang, H. (1997) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/262839.262847 · Cited by 128
Self-citation
Cited by
Ennab, M., & Mcheick, H. (2025) · Machine Learning and Knowledge Extraction · doi:10.3390/make7010012 · Cited by 114
Metadata
- Authors
- Zhang, H., Manocha, D., Hudson, T., & Hoff, K. E.
- Venue
- Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 77-88
- OpenAlex
- W2071516467
- Cited by
- 343
- References
- 10
- FWCI
- 13.36
- Type
- conference paper
- 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
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.