The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
Surface coding based on Morse theory
Abstract
Coding system requirements are briefly discussed. Classical Morse theory, which was primarily motivated by the calculus of variations, is reviewed. The limits of the theory are examined, and an extension that enables 3-D surfaces to be accurately reconstructed from cross sections is presented. The resulting coding works interactively with a range of surface reconstruction systems. The prototype coding system is applied to representing the hierarchical structure of contours.>
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
Milnor, J. (1963) · doi:10.1515/9781400881802 · Cited by 1,390
Optimal surface reconstruction from planar contours
Fuchs, H., Kedem, Z. M., & Uselton, S. P. (1977) · Communications of the ACM · doi:10.1145/359842.359846 · Cited by 798
The Calculus of Variations in the Large
Morse, M. (1934) · Colloquium Publications · doi:10.1090/coll/018 · Cited by 625
A polyhedron representation for computer vision
Baumgart, B. G. (1975) · Proceedings of the May 19-22, 1975, national computer conference and exposition on - AFIPS '75 · doi:10.1145/1499949.1500071 · Cited by 488
Conversion of complex contour line definitions into polygonal element mosaics
Christiansen, H. N., & Sederberg, T. W. (1978) · Proceedings of the 5th annual conference on Computer graphics and interactive techniques · doi:10.1145/800248.807388 · Cited by 317
Conversion of complex contour line definitions into polygonal element mosaics
Christiansen, H. N., & Sederberg, T. W. (1978) · ACM SIGGRAPH Computer Graphics · doi:10.1145/965139.807388 · Cited by 231
GWB: A Solid Modeler with Euler Operators
Mantyla, & Sulonen (1982) · IEEE Computer Graphics and Applications · doi:10.1109/mcg.1982.1674396 · Cited by 158
Cited by
Topology matching for fully automatic similarity estimation of 3D shapes
Hilaga, M., Shinagawa, Y., Kohmura, T., & Kunii, T. L. (2001) · Proceedings of the 28th annual conference on Computer graphics and interactive techniques · doi:10.1145/383259.383282 · Cited by 2,187
Self-citationLeast squares conformal maps for automatic texture atlas generation
Lévy, B., Petitjean, S., Ray, N., & Maillot, J. (2002) · Proceedings of the 29th annual conference on Computer graphics and interactive techniques · doi:10.1145/566570.566590 · Cited by 943
Least squares conformal maps for automatic texture atlas generation
Lévy, B., Petitjean, S., Ray, N., & Maillot, J. (2002) · ACM Transactions on Graphics · doi:10.1145/566654.566590 · Cited by 699
Hierarchical mesh decomposition using fuzzy clustering and cuts
Katz, S., & Tal, A. (2003) · ACM SIGGRAPH 2003 Papers · doi:10.1145/1201775.882369 · Cited by 577
Hierarchical mesh decomposition using fuzzy clustering and cuts
Katz, S., & Tal, A. (2003) · ACM Transactions on Graphics · doi:10.1145/882262.882369 · Cited by 477
Computing contour trees in all dimensions
Carr, H., Snoeyink, J., & Axen, U. (2003) · Computational Geometry · doi:10.1016/s0925-7721(02)00093-7 · Cited by 455
Reeb graphs for shape analysis and applications
Biasotti, S., Giorgi, D., Spagnuolo, M., & Falcidieno, B. (2008) · Theoretical Computer Science · doi:10.1016/j.tcs.2007.10.018 · Cited by 281
3D Skeletons: A State‐of‐the‐Art Report
Tagliasacchi, A., Delame, T., Spagnuolo, M., Amenta, N., & Telea, A. (2016) · Computer Graphics Forum · doi:10.1111/cgf.12865 · Cited by 264
Retrieving articulated 3-D models using medial surfaces
Siddiqi, K., Zhang, J., Macrini, D., Shokoufandeh, A., Bouix, S., & Dickinson, S. (2008) · Machine Vision and Applications · doi:10.1007/s00138-007-0097-8 · Cited by 256
Three-dimensional metamorphosis: a survey
Lazarus, F., & Verroust, A. (1998) · The Visual Computer · doi:10.1007/s003710050149 · Cited by 146
Soatto, S. (2011) · arXiv · doi:10.48550/arxiv.1110.2053 · Cited by 40
Metadata
- Authors
- Shinagawa, Y., Kunii, T. L., & Kergosien, Y. L.
- Venue
- IEEE Computer Graphics and Applications
- Published
- 1991-09
- Volume
- 11
- Issue
- 5
- Pages
- 66-78
- ISSN
- 0272-1716 (ISSN-L)
- 1558-1756
- OpenAlex
- W2002211861
- Cited by
- 334
- References
- 7
- FWCI
- 11.59
- 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
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.