111 related articles for article (PubMed ID: 37021884)
1. Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data - An Algorithm and A Benchmark.
Guillou P; Vidal J; Tierny J
IEEE Trans Vis Comput Graph; 2023 Jan; PP():. PubMed ID: 37021884
[TBL] [Abstract][Full Text] [Related]
2. A GPU Parallel Algorithm for Computing Morse-Smale Complexes.
Subhash V; Pandey K; Natarajan V
IEEE Trans Vis Comput Graph; 2023 Sep; 29(9):3873-3887. PubMed ID: 35552135
[TBL] [Abstract][Full Text] [Related]
3. Progressive Wasserstein Barycenters of Persistence Diagrams.
Vidal J; Budin J; Tierny J
IEEE Trans Vis Comput Graph; 2019 Aug; ():. PubMed ID: 31403427
[TBL] [Abstract][Full Text] [Related]
4. A Progressive Approach to Scalar Field Topology.
Vidal J; Guillou P; Tierny J
IEEE Trans Vis Comput Graph; 2021 Jun; 27(6):2833-2850. PubMed ID: 33606631
[TBL] [Abstract][Full Text] [Related]
5. Generalized Topological Simplification of Scalar Fields on Surfaces.
Tierny J; Pascucci V
IEEE Trans Vis Comput Graph; 2012 Dec; 18(12):2005-13. PubMed ID: 26357106
[TBL] [Abstract][Full Text] [Related]
6. Jacobi Fiber Surfaces for Bivariate Reeb Space Computation.
Tierny J; Carr H
IEEE Trans Vis Comput Graph; 2017 Jan; 23(1):960-969. PubMed ID: 27875209
[TBL] [Abstract][Full Text] [Related]
7. The Topology ToolKit.
Tierny J; Favelier G; Levine JA; Gueunet C; Michaux M
IEEE Trans Vis Comput Graph; 2018 Jan; 24(1):832-842. PubMed ID: 28866503
[TBL] [Abstract][Full Text] [Related]
8. Parallel Computation of Piecewise Linear Morse-Smale Segmentations.
Maack RGC; Lukasczyk J; Tierny J; Hagen H; Maciejewski R; Garth C
IEEE Trans Vis Comput Graph; 2024 Apr; 30(4):1942-1955. PubMed ID: 37030777
[TBL] [Abstract][Full Text] [Related]
9. Principal Geodesic Analysis of Merge Trees (and Persistence Diagrams).
Pont M; Vidal J; Tierny J
IEEE Trans Vis Comput Graph; 2023 Feb; 29(2):1573-1589. PubMed ID: 36251893
[TBL] [Abstract][Full Text] [Related]
10. A practical approach to Morse-Smale complex computation: scalability and generality.
Gyulassy A; Bremer PT; Hamann B; Pascucci V
IEEE Trans Vis Comput Graph; 2008; 14(6):1619-26. PubMed ID: 18989018
[TBL] [Abstract][Full Text] [Related]
11. A minimal contouring approach to the computation of the Reeb graph.
Patanè G; Spagnuolo M; Falcidieno B
IEEE Trans Vis Comput Graph; 2009; 15(4):583-95. PubMed ID: 19423883
[TBL] [Abstract][Full Text] [Related]
12. Wasserstein Dictionaries of Persistence Diagrams.
Sisouk K; Delon J; Tierny J
IEEE Trans Vis Comput Graph; 2024 Feb; 30(2):1638-1651. PubMed ID: 37930922
[TBL] [Abstract][Full Text] [Related]
13. Computing Reeb Graphs as a Union of Contour Trees.
Doraiswamy H; Natarajan V
IEEE Trans Vis Comput Graph; 2013 Feb; 19(2):249-62. PubMed ID: 22529327
[TBL] [Abstract][Full Text] [Related]
14. ExTreeM: Scalable Augmented Merge Tree Computation via Extremum Graphs.
Lukasczyk J; Will M; Wetzels F; Weber GH; Garth C
IEEE Trans Vis Comput Graph; 2024 Jan; 30(1):1085-1094. PubMed ID: 37871087
[TBL] [Abstract][Full Text] [Related]
15. Fast and Exact Fiber Surfaces for Tetrahedral Meshes.
Klacansky P; Tierny J; Carr H; Zhao Geng
IEEE Trans Vis Comput Graph; 2017 Jul; 23(7):1782-1795. PubMed ID: 28113433
[TBL] [Abstract][Full Text] [Related]
16. Wasserstein Distances, Geodesics and Barycenters of Merge Trees.
Pont M; Vidal J; Delon J; Tierny J
IEEE Trans Vis Comput Graph; 2022 Jan; 28(1):291-301. PubMed ID: 34596544
[TBL] [Abstract][Full Text] [Related]
17. Efficient computation of Morse-Smale complexes for three-dimensional scalar functions.
Gyulassy A; Natarajan V; Pascucci V; Hamann B
IEEE Trans Vis Comput Graph; 2007; 13(6):1440-7. PubMed ID: 17968095
[TBL] [Abstract][Full Text] [Related]
18. Computing Persistent Homology by Spanning Trees and Critical Simplices.
Shi D; Chen Z; Ma C; Chen G
Research (Wash D C); 2023; 6():0230. PubMed ID: 37719051
[TBL] [Abstract][Full Text] [Related]
19. Persistent homology of unweighted complex networks via discrete Morse theory.
Kannan H; Saucan E; Roy I; Samal A
Sci Rep; 2019 Sep; 9(1):13817. PubMed ID: 31554857
[TBL] [Abstract][Full Text] [Related]
20. Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees.
Tierny J; Gyulassy A; Simon E; Pascucci V
IEEE Trans Vis Comput Graph; 2009; 15(6):1177-84. PubMed ID: 19834187
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
