The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
Hierarchical data structures and algorithms for computer graphics. I. Fundamentals
Abstract
The fundamentals of hierarchical data structures are reviewed and it is shown how they are used in the implementation of some basic operations in computer graphics. The properties of hierarchical structures are discussed, focusing on quadtrees and octrees. The latter are defined, some of the more common ways in which they are implemented are examined, and an explanation of the quadtree/octree complexity theorem is provided. Vector quadtrees and vector octrees are discussed. The performance of basic operations using quadtrees is considered.>
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
Representations for Rigid Solids: Theory, Methods, and Systems
Requicha, A. G. (1980) · ACM Computing Surveys · doi:10.1145/356827.356833 · Cited by 1,436
Cited by
Collision detection for interactive graphics applications
Hubbard, P. M. (1995) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.466717 · Cited by 414
Metadata
- Authors
- Samet, H., & Webber, R. E.
- Venue
- IEEE Computer Graphics and Applications
- Published
- 1988-05
- Volume
- 8
- Issue
- 3
- Pages
- 48-68
- ISSN
- 0272-1716 (ISSN-L)
- OpenAlex
- W2081946972
- Cited by
- 185
- References
- 1
- FWCI
- 15.90
- Type
- journal article
- 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 data structures and algorithms for computer graphics. I. Fundamentals. https://app.cochat.ai/papers/10.1109/38.513
- The paper
- Samet, H., & Webber, R. E. (1988). Hierarchical data structures and algorithms for computer graphics. I. Fundamentals. IEEE Computer Graphics and Applications. https://doi.org/10.1109/38.513
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.