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.
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
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 9,680
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
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Reeb graphs for shape analysis and applications. https://app.cochat.ai/papers/10.1016/j.tcs.2007.10.018
- The paper
- Biasotti, S., Giorgi, D., Spagnuolo, M., & Falcidieno, B. (2008). Reeb graphs for shape analysis and applications. Theoretical Computer Science. https://doi.org/10.1016/j.tcs.2007.10.018
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.