111 related articles for article (PubMed ID: 37871087)
1. 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]
2. A Structural Average of Labeled Merge Trees for Uncertainty Visualization.
Yan L; Wang Y; Munch E; Gasparovic E; Wang B
IEEE Trans Vis Comput Graph; 2020 Jan; 26(1):832-842. PubMed ID: 31403426
[TBL] [Abstract][Full Text] [Related]
3. Geometry-Aware Merge Tree Comparisons for Time-Varying Data With Interleaving Distances.
Yan L; Masood TB; Rasheed F; Hotz I; Wang B
IEEE Trans Vis Comput Graph; 2023 Aug; 29(8):3489-3506. PubMed ID: 35349444
[TBL] [Abstract][Full Text] [Related]
4. Scalable Contour Tree Computation by Data Parallel Peak Pruning.
Carr HA; Weber GH; Sewell CM; Rubel O; Fasel P; Ahrens JP
IEEE Trans Vis Comput Graph; 2021 Apr; 27(4):2437-2454. PubMed ID: 31689193
[TBL] [Abstract][Full Text] [Related]
5. Unordered Task-Parallel Augmented Merge Tree Construction.
Werner K; Garth C
IEEE Trans Vis Comput Graph; 2021 Aug; 27(8):3585-3596. PubMed ID: 33929962
[TBL] [Abstract][Full Text] [Related]
6. 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]
7. Detecting symmetry in scalar fields using augmented extremum graphs.
Thomas DM; Natarajan V
IEEE Trans Vis Comput Graph; 2013 Dec; 19(12):2663-72. PubMed ID: 24051833
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. Edit Distance between Merge Trees.
Sridharamurthy R; Masood TB; Kamakshidasan A; Natarajan V
IEEE Trans Vis Comput Graph; 2020 Mar; 26(3):1518-1531. PubMed ID: 30295620
[TBL] [Abstract][Full Text] [Related]
10. 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]
11. Toward Localized Topological Data Structures: Querying the Forest for the Tree.
Klacansky P; Gyulassy A; Bremer PT; Pascucci V
IEEE Trans Vis Comput Graph; 2020 Jan; 26(1):173-183. PubMed ID: 31403428
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. TurboBC: A Memory Efficient and Scalable GPU Based Betweenness Centrality Algorithm in the Language of Linear Algebra.
Artiles O; Saeed F
Proc Int Workshops Parallel Proc; 2021 Aug; 2021():. PubMed ID: 35440894
[TBL] [Abstract][Full Text] [Related]
14. 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]
15. Optimization and Augmentation for Data Parallel Contour Trees.
Carr HA; Rubel O; Weber GH; Ahrens JP
IEEE Trans Vis Comput Graph; 2022 Oct; 28(10):3471-3485. PubMed ID: 33684039
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. 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]
18. PACC: Large scale connected component computation on Hadoop and Spark.
Park HM; Park N; Myaeng SH; Kang U
PLoS One; 2020; 15(3):e0229936. PubMed ID: 32187232
[TBL] [Abstract][Full Text] [Related]
19. Distributed large-scale graph processing on FPGAs.
Sahebi A; Barbone M; Procaccini M; Luk W; Gaydadjiev G; Giorgi R
J Big Data; 2023; 10(1):95. PubMed ID: 37283690
[TBL] [Abstract][Full Text] [Related]
20. cmFSM: a scalable CPU-MIC coordinated drug-finding tool by frequent subgraph mining.
Yang S; Guo R; Liu R; Liao X; Zou Q; Shi B; Peng S
BMC Bioinformatics; 2018 May; 19(Suppl 4):98. PubMed ID: 29745832
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
