The DOI matches its Crossref record; 6 of the 6 references it cites were found in a registry or an index.
Re-tiling polygonal surfaces
Open accessAbstract
This paper presents an automatic method of creating surface models at several levels of detail from an original polygonal description of a given object.Representing models at various levels of detail is important for achieving high frame rates in interactive graphics applications and also for speeding-up the off-line rendering of complex scenes.Unfortunately, generating these levels of detail is a time-consuming task usually left to a human modeler.This paper shows how a new set of vertices can be distributed over the surface of a model and connected to one anolher to create a re-tiling of a surface that is faithful to both the geometry and the topology of the original surface, The main contributions of this paper are: I ) a robust method of connecting together new vertices over a surface, 2) a way of using an estimate of surface curvature to distribute more new vertices at regions of higher curvature and 3) a method of smoothly interpolating between models that represent the same object at different levels of detail.The key notion in the re-tiling procedure is the creation of an intermediate model called the mufual fessellafion of a surface that contains both the vertices from the original model and the new points that are to become vertices in there-tiled surface.The new model is then created by removing each original vertex and locally re-triangulating the surface in a way that matches the local connectedness of the initial surface.This technique for surface retessellation has been successfully applied to iso-surface models derived from volume data, Connolly surface molecular models and a tessellation of a minimal surface of interest to mathematicians.
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
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
Hierarchical geometric models for visible surface algorithms
Clark, J. H. (1976) · Communications of the ACM · doi:10.1145/360349.360354 · Cited by 778
Williams, L. (1983) · Proceedings of the 10th annual conference on Computer graphics and interactive techniques · doi:10.1145/800059.801126 · Cited by 715
Finite element mesh generation methods: a review and classification
Ho-Le, K. (1988) · Computer-Aided Design · doi:10.1016/0010-4485(88)90138-8 · Cited by 429
Generating textures on arbitrary surfaces using reaction-diffusion
Turk, G. (1991) · ACM SIGGRAPH Computer Graphics · doi:10.1145/127719.122749 · Cited by 239
Self-citationDelaunay-based representation of surfaces defined over arbitrarily shaped domains
Floriani, L. D., Falcidieno, B., & Pienovi, C. (1985) · Computer Vision Graphics and Image Processing · doi:10.1016/0734-189x(85)90005-2 · Cited by 121
Cited by
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
Zippered polygon meshes from range images
Turk, G., & Levoy, M. (1994) · Proceedings of the 21st annual conference on Computer graphics and interactive techniques - SIGGRAPH '94 · doi:10.1145/192161.192241 · Cited by 1,326
Self-citationHoppe, 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
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
Metadata
- Authors
- Turk, G.
- Venue
- ACM SIGGRAPH Computer Graphics
- Published
- 1992-07
- Volume
- 26
- Issue
- 2
- Pages
- 55-64
- ISSN
- 0097-8930 (ISSN-L)
- OpenAlex
- W2997144757
- Cited by
- 335
- References
- 6
- FWCI
- 15.40
- Type
- journal article
- 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.