The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Surface simplification using quadric error metrics
Abstract
Many applications in computer graphics require complex, highly detailed models. However, the level of detail actually necessary may vary considerably. To control processing time, it is often desirable to use approximations in place of excessively detailed models. We have developed a surface simplification algorithm which can rapidly produce high quality approximations of polygonal models. The algorithm uses iterative contractions of vertex pairs to simplify models and maintains surface error approximations using quadric matrices. By contracting arbitrary vertex pairs (not just edges), our algorithm is able to join unconnected regions of models. This can facilitate much better approximations, both visually and with re-spect to geometric error. In order to allow topological joining, our system also supports non-manifold surface models.
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
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
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
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
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
View-dependent simplification of arbitrary polygonal environments
Luebke, D., & Erikson, C. (1997) · Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97 · doi:10.1145/258734.258847 · Cited by 508
Cited by
Discrete Differential-Geometry Operators for Triangulated 2-Manifolds
Meyer, M., Desbrun, M., Schröder, P., & Barr, A. H. (2003) · Mathematics and Visualization · doi:10.1007/978-3-662-05105-4_2 · Cited by 1,889
SCAPE: shape completion and animation of people
Anguelov, D., Srinivasan, P., Koller, D., Thrun, S., Rodgers, J., & Davis, J. (2005) · ACM Transactions on Graphics · doi:10.1145/1073204.1073207 · Cited by 1,489
Eitz, M., Hays, J., & Alexa, M. (2012) · ACM Transactions on Graphics · doi:10.1145/2185520.2185540 · Cited by 868
The YCB object and model set: Towards common benchmarks for manipulation research
Calli, B., Singh, A., Walsman, A., Srinivasa, S., Abbeel, P., & Dollar, A. M. (2015) · 2015 International Conference on Advanced Robotics (ICAR) · doi:10.1109/icar.2015.7251504 · Cited by 838
“Execution time can be reduced using a simplified mesh produced either by hand or with automatic decimation methods [32].”
MethodShojima, M., Oshima, M., Takagi, K., Torii, R., Hayakawa, M., Katada, K., Morita, A., & Kirino, T. (2004) · Stroke · doi:10.1161/01.str.0000144648.89172.0f · Cited by 790
Metadata
- Authors
- Garland, M., & Heckbert, P. S.
- Venue
- Proceedings of the 24th annual conference on Computer graphics and interactive techniques - SIGGRAPH '97
- Publisher
- ACM Press
- Published
- 1997
- Pages
- 209-216
- OpenAlex
- W2235901111
- Cited by
- 3,412
- References
- 6
- FWCI
- 34.62
- 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
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.