The DOI matches its Crossref record; 14 of the 14 references it cites were found in a registry or an index.
Progressive simplicial complexes
Abstract
In this paper, we introduce the progressive simplicial complex (PSC) representation, a new format for storing and transmitting triangulated geometric models. Like the earlier progressive mesh (PM) representation, it captures a given model as a coarse base model together with a sequence of refinement transformations that progressively recover detail. The PSC representation makes use of a more general refinement transformation, allowing the given model to be an arbitrary triangulation (e.g. any dimension, non-orientable, non-manifold, non-regular), and the base model to always consist of a single vertex. Indeed, the sequence of refinement transformations encodes both the geometry and the topology of the model in a unified multiresolution framework. The PSC representation retains the advantages of PM’s. It defines a continuous sequence of approximating models for runtime level-of-detail control, allows smooth transitions between any pair of models in the sequence, supports progressive transmission, and offers a space-efficient representation. Moreover, by allowing changes to topology, the PSC sequence of approximations achieves better fidelity than the corresponding PM sequence. We develop an optimization algorithm for constructing PSC representations for graphics surface models, and demonstrate the framework on models that are both geometrically and topologically complex.
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
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
Spanier, E. H. (1990) · Cited by 3,014
Arithmetic coding for data compression
Witten, I. H., Neal, R. M., & Cleary, J. G. (1987) · Communications of the ACM · doi:10.1145/214762.214771 · Cited by 2,877
Hoppe, H. (1996) · Proceedings of the 23rd annual conference on Computer graphics and interactive techniques · doi:10.1145/237170.237216 · Cited by 2,817
Self-citationSchroeder, 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
Hoppe, H., DeRose, T., Duchamp, T., McDonald, J., & Stuetzle, W. (1993) · Proceedings of the 20th annual conference on Computer graphics and interactive techniques · doi:10.1145/166117.166119 · Cited by 1,303
Self-citationHierarchical 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
Cited by
Simplification and repair of polygonal models using volumetric techniques
Nooruddin, F. S., & Turk, G. (2003) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2003.1196006 · Cited by 504
Simplifying surfaces with color and texture using quadric error metrics
Garland, M., & Heckbert, P. S. (1998) · doi:10.5555/288216.288280 · Cited by 403
Adaptive anisotropic remeshing for cloth simulation
Narain, R., Samii, A., & O'Brien, J. F. (2012) · ACM Transactions on Graphics · doi:10.1145/2366145.2366171 · Cited by 341
Praun, E., Hoppe, H., & Finkelstein, A. (1999) · Proceedings of the 26th annual conference on Computer graphics and interactive techniques - SIGGRAPH '99 · doi:10.1145/311535.311540 · Cited by 321
Self-citationSCHROEDER, W. J., & MARTIN, K. M. (2005) · Visualization Handbook · doi:10.1016/b978-012387582-2/50003-4 · Cited by 285
Metadata
- Authors
- Popović, J., & Hoppe, H.
- Venue
- Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 217-224
- OpenAlex
- W2089866148
- Cited by
- 327
- References
- 14
- FWCI
- 15.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: Progressive simplicial complexes. https://app.cochat.ai/papers/10.1145/258734.258852
- The paper
- Popović, J., & Hoppe, H. (1997). Progressive simplicial complexes. Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97. https://doi.org/10.1145/258734.258852
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.