The DOI matches its Crossref record; 10 of the 10 references it cites were found in a registry or an index.
Topological persistence and simplification
Abstract
We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens during growth as either a feature or noise, depending on its life-time or persistence within the filtration. We give fast algorithms for completing persistence and experimental evidence for their speed and utility.
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
Rayward-Smith, V. J. (1991) · Journal of the Operational Research Society · doi:10.1057/jors.1991.155 · Cited by 16,821
Three-dimensional alpha shapes
Edelsbrunner, H., & Mücke, E. P. (1994) · ACM Transactions on Graphics · doi:10.1145/174462.156635 · Cited by 2,488
Self-citationLevel Set Methods: An Overview and Some Recent Results
Osher, S., & Fedkiw, R. P. (2001) · Journal of Computational Physics · doi:10.1006/jcph.2000.6636 · Cited by 2,327
Elements of Algebraic Topology
Munkres, J. R. (2018) · CRC Press eBooks · doi:10.1201/9780429493911 · Cited by 2,102
ELEMENTS OF ALGEBRAIC TOPOLOGY
KURATOWSKI, K. (1972) · Introduction to Set Theory and Topology · doi:10.1016/b978-0-08-016160-0.50028-2 · Cited by 1,277
A User's Guide to Spectral Sequences
McCleary, J. (2000) · Cambridge University Press eBooks · doi:10.1017/cbo9780511626289 · Cited by 838
Simulation of simplicity: a technique to cope with degenerate cases in geometric algorithms
Edelsbrunner, H., & Mücke, E. P. (1990) · ACM Transactions on Graphics · doi:10.1145/77635.77639 · Cited by 711
Self-citationGrossman, P. (1995) · Discrete Mathematics for Computing · doi:10.1007/978-1-349-13908-8_1 · Cited by 672
An incremental algorithm for Betti numbers of simplicial complexes on the 3-sphere
Delfinado, C. J. A., & Edelsbrunner, H. (1995) · Computer Aided Geometric Design · doi:10.1016/0167-8396(95)00016-y · Cited by 183
Self-citationTopology simplification for polygonal virtual environments
El-Sana, J., & Varshney, A. (1998) · IEEE Transactions on Visualization and Computer Graphics · doi:10.1109/2945.694955 · Cited by 58
Cited by
Carlsson, G. (2009) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-09-01249-x · Cited by 2,302
“This philosophy is referred to as persistence, and was first introduced in [24].”
BackgroundStability of Persistence Diagrams
Cohen-Steiner, D., Edelsbrunner, H., & Harer, J. (2007) · Discrete & Computational Geometry · doi:10.1007/s00454-006-1276-5 · Cited by 1,280
Self-citationBarcodes: the persistent topology of data
Ghrist, R. (2007) · Bulletin of the American Mathematical Society · doi:10.1090/s0273-0979-07-01191-3 · Cited by 1,236
“Persistence, as introduced by Edelsbrunner, Letscher, and Zomo-rodian [12] and refined by Carlsson and Zomorodian [22], is a rigorous response to this problem.”
MethodShape google: Geometric words and expressions for invariant shape retrieval
Bronstein, A. M., Bronstein, M. M., Guibas, L. J., & Ovsjanikov, M. (2011) · ACM Transactions on Graphics · doi:10.1145/1899404.1899405 · Cited by 810
A roadmap for the computation of persistent homology
Otter, N., Porter, M. A., Tillmann, U., Grindrod, P., & Harrington, H. A. (2017) · EPJ Data Science · doi:10.1140/epjds/s13688-017-0109-5 · Cited by 760
Sousbie, T. (2011) · Monthly Notices of the Royal Astronomical Society · doi:10.1111/j.1365-2966.2011.18394.x · Cited by 674
associated_data_Investigating the Effectiveness of clDice Loss for Road Crack Segmentation
Pereira, V. (2025) · arXiv (Cornell University) · doi:10.5281/zenodo.15696262 · Cited by 548
On the Local Behavior of Spaces of Natural Images
Carlsson, G., Ishkhanov, T., de Silva, V., & Zomorodian, A. (2008) · International Journal of Computer Vision · doi:10.1007/s11263-007-0056-x · Cited by 477
Self-citationMutations Strengthened SARS-CoV-2 Infectivity
Chen, J., Wang, R., Wang, M., & Wei, G.-W. (2020) · Journal of Molecular Biology · doi:10.1016/j.jmb.2020.07.009 · Cited by 466
Coverage in sensor networks via persistent homology
de Silva, V., & Ghrist, R. (2007) · Algebraic & Geometric Topology · doi:10.2140/agt.2007.7.339 · Cited by 422
Clique topology reveals intrinsic geometric structure in neural correlations
Giusti, C., Pastalkova, E., Curto, C., & Itskov, V. (2015) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1506407112 · Cited by 381
Topological estimation using witness complexes
Silva, V. D., & Carlsson, G. (2004) · The Eurographics Association · doi:10.2312/spbg/spbg04/157-166 · Cited by 337
Cang, Z., & Wei, G.-W. (2017) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005690 · Cited by 330
The Why, How, and When of Representations for Complex Systems
Torres, L., Blevins, A. S., Bassett, D., & Eliassi-Rad, T. (2021) · SIAM Review · doi:10.1137/20m1355896 · Cited by 297
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
Self-citationA Topological Loss Function for Deep-Learning Based Image Segmentation Using Persistent Homology
Clough, J. R., Byrne, N., Oksuz, I., Zimmer, V. A., Schnabel, J. A., & King, A. P. (2022) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2020.3013679 · Cited by 272
Chan, J. M., Carlsson, G., & Rabadan, R. (2013) · Proceedings of the National Academy of Sciences · doi:10.1073/pnas.1313480110 · Cited by 269
Zomorodian, A., & Carlsson, G. (2004) · Proceedings of the twentieth annual symposium on Computational geometry · doi:10.1145/997817.997870 · Cited by 264
Self-citationTopological data analysis of financial time series: Landscapes of crashes
Gidea, M., & Katz, Y. (2018) · Physica A: Statistical Mechanics and its Applications · doi:10.1016/j.physa.2017.09.028 · Cited by 263
Cang, Z., Mu, L., & Wei, G.-W. (2018) · PLOS Computational Biology · doi:10.1371/journal.pcbi.1005929 · Cited by 257
Topological pattern recognition for point cloud data
Carlsson, G. (2014) · Acta Numerica · doi:10.1017/s0962492914000051 · Cited by 230
Gromov‐Hausdorff Stable Signatures for Shapes using Persistence
Chazal, F., Cohen‐Steiner, D., Guibas, L. J., Mémoli, F., & Oudot, S. Y. (2009) · Computer Graphics Forum · doi:10.1111/j.1467-8659.2009.01516.x · Cited by 225
Wang, R., Chen, J., Gao, K., & Wei, G.-W. (2021) · Genomics · doi:10.1016/j.ygeno.2021.05.006 · Cited by 191
Topological analysis of population activity in visual cortex
Singh, G., Memoli, F., Ishkhanov, T., Sapiro, G., Carlsson, G., & Ringach, D. L. (2008) · Journal of Vision · doi:10.1167/8.8.11 · Cited by 213
Quantitative Toxicity Prediction Using Topology Based Multitask Deep Neural Networks
Wu, K., & Wei, G.-W. (2018) · Journal of Chemical Information and Modeling · doi:10.1021/acs.jcim.7b00558 · Cited by 160
Alpha, Betti and the Megaparsec Universe: On the Topology of the Cosmic Web
van de Weygaert, R., Vegter, G., Edelsbrunner, H., Jones, B. J. T., Pranav, P., Park, C., Hellwing, W. A., Eldering, B., Kruithof, N., Bos, E. G. P., et al. (2011) · Lecture Notes in Computer Science · doi:10.1007/978-3-642-25249-5_3 · Cited by 84
Self-citation(2024) · doi:10.1038/s42256-024-00855-1 · Cited by 57
A spectral sequence for parallelized persistence
Lipsky, D., Skraba, P., & Vejdemo-Johansson, M. (2011) · arXiv · doi:10.48550/arxiv.1112.1245 · Cited by 22
“The key to the success of homology in computational geometry, as well as in other application fields – is the introduction in [13] of persistent homology, a multi-scale approach to the computation of homological features given a point cloud of samples.”
BackgroundInfluentialclDice - a Novel Topology-Preserving Loss Function for Tubular Structure Segmentation
Shit, S., Paetzold, J. C., Sekuboyina, A., Ezhov, I., Unger, A., Zhylka, A., Pluim, J. P. W., Bauer, U., & Menze, B. H. (2021) · 2021 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr46437.2021.01629 · Cited by 60
“However, analyzing preservation of topology while simplifying geometries is a difficult analytical and computational problem [11, 10].”
Background
Metadata
- Authors
- Edelsbrunner, H., Letscher, D., & Zomorodian, A.
- Venue
- Proceedings 41st Annual Symposium on Foundations of Computer Science
- Publisher
- IEEE Comput. Soc
- Published
- 2002-11-07
- Pages
- 454-463
- ISSN
- 0272-5428 (ISSN-L)
- OpenAlex
- W2096736341
- Cited by
- 652
- References
- 10
- FWCI
- 5.91
- 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.