The DOI matches its Crossref record; 34 of the 34 references it cites were found in a registry or an index.
Reeb graphs for shape analysis and applications
Open accessAbstract
Reeb graphs are compact shape descriptors which convey topological information related to the level sets of a function defined on the shape. Their definition dates back to 1946, and finds its root in Morse theory. Reeb graphs as shape descriptors have been proposed to solve different problems arising in Computer Graphics, and nowadays they play a fundamental role in the field of computational topology for shape analysis. This paper provides an overview of the mathematical properties of Reeb graphs and reconstructs its history in the Computer Graphics context, with an eye towards directions of future research.
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
Berman, H. M. (2000) · Nucleic Acids Research · doi:10.1093/nar/28.1.235 · Cited by 40,196
Introduction to Modern Information Retrieval
Salton, G., & McGill, M. J. (1983) · Virtual Defense Library (Ministerio de Defensa) · Cited by 11,392
Introduction to modern information retrieval
Dillon, M. (1983) · Information Processing & Management · doi:10.1016/0306-4573(83)90062-6 · Cited by 5,909
(2001) · Cited by 5,374
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
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
The digital Michelangelo project
Levoy, M. (2003) · Second International Conference on 3-D Digital Imaging and Modeling (Cat. No.PR00062) · doi:10.1109/im.1999.805329 · Cited by 1,608
Algebraic Topology: An Introduction.
Mitchell, B., & Massey, W. S. (1968) · The American Mathematical Monthly · doi:10.2307/2313470 · Cited by 1,171
Morse Theory for Cell Complexes
Forman, R. (1998) · Advances in Mathematics · doi:10.1006/aima.1997.1650 · Cited by 943
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
Laplace-Beltrami Eigenfunctions Towards an Algorithm That "Understands" Geometry
Levy, B. (2006) · IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06) · doi:10.1109/smi.2006.21 · Cited by 422
Surface coding based on Morse theory
Shinagawa, Y., Kunii, T. L., & Kergosien, Y. L. (1991) · IEEE Computer Graphics and Applications · doi:10.1109/38.90568 · Cited by 334
Spectral surface quadrangulation
Dong, S., Bremer, P.-T., Garland, M., Pascucci, V., & Hart, J. C. (2006) · ACM Transactions on Graphics · doi:10.1145/1141911.1141993 · Cited by 315
Hierarchical Morse--Smale Complexes for Piecewise Linear 2-Manifolds
Edelsbrunner, H., Harer, J., & Zomorodian, A. (2003) · Discrete and Computational Geometry · doi:10.1007/s00454-003-2926-5 · Cited by 293
Feature-based surface parameterization and texture mapping
Zhang, E., Mischaikow, K., & Turk, G. (2005) · ACM Transactions on Graphics · doi:10.1145/1037957.1037958 · Cited by 288
Stability of persistence diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2005) · Proceedings of the twenty-first annual symposium on Computational geometry · doi:10.1145/1064092.1064133 · Cited by 251
Removing excess topology from isosurfaces
Wood, Z., Hoppe, H., Desbrun, M., & Schröder, P. (2004) · ACM Transactions on Graphics · doi:10.1145/990002.990007 · Cited by 223
Automated graph-based analysis and correction of cortical volume topology
Shattuck, D. W., & Leahy, R. M. (2001) · IEEE Transactions on Medical Imaging · doi:10.1109/42.963819 · Cited by 215
Critical points and curvature for embedded polyhedra
Banchoff, T. (1967) · Journal of Differential Geometry · doi:10.4310/jdg/1214428092 · Cited by 213
Fair morse functions for extracting the topological structure of a surface mesh
Ni, X., Garland, M., & Hart, J. C. (2004) · ACM Transactions on Graphics · doi:10.1145/1015706.1015769 · Cited by 199
Simplifying flexible isosurfaces using local geometric measures
Carr, H., Snoeyink, J., & van de Panne, M. (2005) · IEEE Visualization 2004 · doi:10.1109/visual.2004.96 · Cited by 194
Sub-part correspondence by structural descriptors of 3D shapes
Biasotti, S., Marini, S., Spagnuolo, M., & Falcidieno, B. (2006) · Computer-Aided Design · doi:10.1016/j.cad.2006.07.003 · Cited by 158
Self-citationRobust 3D Shape Correspondence in the Spectral Domain
Jain, V., & Zhang, H. (2006) · IEEE International Conference on Shape Modeling and Applications 2006 (SMI'06) · doi:10.1109/smi.2006.31 · Cited by 148
Size theory as a topological tool for computer vision
Frosini, P., & Landi, C. (1999) · Cited by 137
Level set diagrams of polyhedral objects
Lazarus, F., & Verroust-Blondet, A. (1999) · ACM Symposium on Solid Modeling and Applications · doi:10.1145/304012.304025 · Cited by 127
Blowing Bubbles for Multi-Scale Analysis and Decomposition of Triangle Meshes
Mortara, M., Patanè, G., Spagnuolo, M., Falcidieno, B., & Rossignac, J. R. (2003) · Algorithmica · doi:10.1007/s00453-003-1051-4 · Cited by 122
Self-citationTopological volume skeletonization and its application to transfer function design
Takahashi, S., Takeshima, Y., & Fujishiro, I. (2003) · Graphical Models · doi:10.1016/j.gmod.2003.08.002 · Cited by 118
3D Shape Matching through Topological Structures
Biasotti, S., Marini, S., Mortara, M., Patanè, G., Spagnuolo, M., & Falcidieno, B. (2003) · Lecture notes in computer science · doi:10.1007/978-3-540-39966-7_18 · Cited by 109
Self-citationSimple and optimal output-sensitive construction of contour trees using monotone paths
Chiang, Y., Lenz, T., Lu, X., & Rote, G. (2004) · Computational Geometry · doi:10.1016/j.comgeo.2004.05.002 · Cited by 82
Extended Reeb Graphs for Surface Understanding and Description
Biasotti, S., Falcidieno, B., & Spagnuolo, M. (2000) · Lecture notes in computer science · doi:10.1007/3-540-44438-6_16 · Cited by 76
Self-citationComputational complexity of combinatorial surfaces
Vegter, G., & Yap, C. K. (1990) · Annual Symposium on Computational Geometry (SoCG) · doi:10.1145/98524.98546 · Cited by 74
Local and global comparison of continuous functions
Edelsbrunner, H., Harer, J., Natarajan, V., & Pascucci, V. (2005) · Visualization · doi:10.1109/visual.2004.68 · Cited by 60
Using matching distance in size theory: A survey
d'Amico, M., Frosini, P., & Landi, C. (2006) · International Journal of Imaging Systems and Technology · doi:10.1002/ima.20076 · Cited by 52
Stability of Critical Points with Interval Persistence
Dey, T. K., & Wenger, R. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-007-1356-1 · Cited by 31
Cited by
Visualizing high-dimensional data: advances in the past decade
Liu, S., Maljovec, D., Wang, B., Bremer, P.-T., & Pascucci, V. (2017) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/tvcg.2016.2640960 · Cited by 427
Metadata
- Authors
- Biasotti, S., Giorgi, D., Spagnuolo, M., & Falcidieno, B.
- Venue
- Theoretical Computer Science
- Publisher
- Elsevier BV
- Published
- 2008-02
- Volume
- 392
- Issue
- 1-3
- Pages
- 5-22
- ISSN
- 0304-3975 (ISSN-L)
- OpenAlex
- W2075608792
- Cited by
- 281
- References
- 34
- FWCI
- 9.90
- 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.