The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
The Topology ToolKit
Open accessAbstract
This system paper presents the Topology ToolKit (TTK), a software platform designed for the topological analysis of scalar data in scientific visualization. While topological data analysis has gained in popularity over the last two decades, it has not yet been widely adopted as a standard data analysis tool for end users or developers. TTK aims at addressing this problem by providing a unified, generic, efficient, and robust implementation of key algorithms for the topological analysis of scalar data, including: critical points, integral lines, persistence diagrams, persistence curves, merge trees, contour trees, Morse-Smale complexes, fiber surfaces, continuous scatterplots, Jacobi sets, Reeb spaces, and more. TTK is easily accessible to end users due to a tight integration with ParaView. It is also easily accessible to developers through a variety of bindings (Python, VTK/C++) for fast prototyping or through direct, dependency-free, C++, to ease integration into pre-existing complex systems. While developing TTK, we faced several algorithmic and software engineering challenges, which we document in this paper. In particular, we present an algorithm for the construction of a discrete gradient that complies to the critical points extracted in the piecewise-linear setting. This algorithm guarantees a combinatorial consistency across the topological abstractions supported by TTK, and importantly, a unified implementation of topological data simplification for multi-scale exploration and analysis. We also present a cached triangulation data structure, that supports time efficient and generic traversals, which self-adjusts its memory usage on demand for input simplicial meshes and which implicitly emulates a triangulation for regular grids with no memory overhead. Finally, we describe an original software architecture, which guarantees memory efficient and direct accesses to TTK features, while still allowing for researchers powerful and easy bindings and extensions. TTK is open source (BSD license) and its code, online documentation and video tutorials are available on TTK's website [108].
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
Topological Persistence and Simplification
Edelsbrunner, Letscher, & Zomorodian (2002) · Discrete & Computational Geometry · doi:10.1007/s00454-002-2885-2 · Cited by 1,779
Zomorodian, A., & Carlsson, G. (2005) · Discrete & Computational Geometry · doi:10.1007/s00454-004-1146-y · Cited by 1,591
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
Topological Methods for the Analysis of High Dimensional Data Sets and 3D Object Recognition
Singh, G., Memoli, F., & Carlsson, G. (2007) · The Eurographics Association · doi:10.2312/spbg/spbg07/091-100 · Cited by 514
Zigzag persistent homology and real-valued functions
Carlsson, G., de Silva, V., & Morozov, D. (2009) · Proceedings of the twenty-fifth annual symposium on Computational geometry · doi:10.1145/1542362.1542408 · Cited by 272
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
The tidy set: a minimal simplicial set for computing homology of clique complexes
Zomorodian, A. (2010) · Proceedings of the twenty-sixth annual symposium on Computational geometry · doi:10.1145/1810959.1811004 · Cited by 52 · cited 1×
“This drawback is attenuated by data structures which aim at balancing time and memory efficiency [20, 21, 115–117] but it is accentuated by data structures which further compress the adjacency information [19, 61, 62, 76].”
Background
Cited by
The DIRAC code for relativistic molecular calculations
Saue, T., Bast, R., Gomes, A. S. P., Jensen, H. J. A., Visscher, L., Aucar, I. A., Di Remigio, R., Dyall, K. G., Eliav, E., Fasshauer, E., et al. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0004844 · Cited by 358
Metadata
- Authors
- Tierny, J., Favelier, G., Levine, J. A., Gueunet, C., & Michaux, M.
- Venue
- IEEE Transactions on Visualization and Computer Graphics
- Published
- 2018-01
- Volume
- 24
- Issue
- 1
- Pages
- 832-842
- ISSN
- 1077-2626 (ISSN-L)
- OpenAlex
- W2614596590
- Cited by
- 210
- References
- 7
- FWCI
- 12.56
- Type
- journal article
- Language
- en
- Open access
- green
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: The Topology ToolKit. https://app.cochat.ai/papers/10.1109/tvcg.2017.2743938
- The paper
- Tierny, J., Favelier, G., Levine, J. A., Gueunet, C., & Michaux, M. (2018). The Topology ToolKit. IEEE Transactions on Visualization and Computer Graphics. https://doi.org/10.1109/tvcg.2017.2743938
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.