The DOI matches its Crossref record; 11 of the 11 references it cites were found in a registry or an index.
View-dependent simplification of arbitrary polygonal environments
Abstract
Hierarchical dynamic simplification (HDS) is a new approach to the problem of simplifying arbitrary polygonal environments. HDS operates dynamically, retessellating the scene continuously as the user's viewing position shifts, and adaptively processing the entire database without first decomposing the environment into individual objects. The resulting system allows real-time display of very complex polygonal CAD models consisting of thousands of parts and hundreds of thousands of polygons. HDS supports various preprocessing algorithms and various run-time criteria, providing a general framework for dynamic view-dependent simplification. Briefly, HDS works by clustering vertices together in a hierarchical fashion. The simplification process continuously queries this hierarchy to generate a scene containing only those polygons that are important from the current viewpoint. When the volume of space associated with a vertex cluster occupies less than a user-specified amount of the screen, all vertices within that cluster are collapsed together and degenerate polygons filtered out. HDS maintains an active list of visible polygons for rendering. Since frame-to-frame movements typically involve small changes in viewpoint, and therefore modify the active list by only a few polygons, the method takes advantage of temporal coherence for greater speed.
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
Hoppe, H. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237216 · Cited by 2,817
Schroeder, W. J., Zarge, J. A., & Lorensen, W. E. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134010 · Cited by 1,464
Multiresolution analysis of arbitrary meshes
Eck, M., DeRose, T., Duchamp, T., Hoppe, H., Lounsbery, M., & Stuetzle, W. (1995) · Proceedings of the 22nd annual conference on Computer graphics and interactive techniques - SIGGRAPH '95 · doi:10.1145/218380.218440 · Cited by 1,205
Hierarchical geometric models for visible surface algorithms
Clark, J. H. (1976) · Communications of the ACM · doi:10.1145/360349.360354 · Cited by 778
Turk, G. (1992) · Proceedings of the 19th annual conference on Computer graphics and interactive techniques · doi:10.1145/133994.134008 · Cited by 738
Multi-resolution 3D approximations for rendering complex scenes
Rossignac, J., & Borrel, P. (1993) · Modeling in Computer Graphics · doi:10.1007/978-3-642-78114-8_29 · Cited by 721
Funkhouser, T. A., & Séquin, C. H. (1993) · Proceedings of the 20th annual conference on Computer graphics and interactive techniques · doi:10.1145/166117.166149 · Cited by 603
Cohen, J., Varshney, A., Manocha, D., Turk, G., Weber, H., Agarwal, P., Brooks, F., & Wright, W. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237220 · Cited by 528
Turk, G. (1992) · ACM SIGGRAPH Computer Graphics · doi:10.1145/142920.134008 · Cited by 335
Visual navigation of large environments using textured clusters
Maciel, P. W. C., & Shirley, P. (1995) · ACM Symposium on Interactive 3D Graphics (I3D) · doi:10.1145/199404.199420 · Cited by 298
Cited by
Surface simplification using quadric error metrics
Garland, M., & Heckbert, P. S. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258849 · Cited by 3,412
Topology simplification for polygonal virtual environments
El-Sana, J., & Varshney, A. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.694955 · Cited by 58
Metadata
- Authors
- Luebke, D., & Erikson, C.
- Venue
- Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 199-208
- OpenAlex
- W2043242530
- Cited by
- 508
- References
- 11
- FWCI
- 19.03
- 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: View-dependent simplification of arbitrary polygonal environments. https://app.cochat.ai/papers/10.1145/258734.258847
- The paper
- Luebke, D., & Erikson, C. (1997). View-dependent simplification of arbitrary polygonal environments. Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97. https://doi.org/10.1145/258734.258847
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.
