These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.
138 related articles for article (PubMed ID: 21301023)
1. Output-Sensitive Construction of Reeb Graphs. Doraiswamy H; Natarajan V IEEE Trans Vis Comput Graph; 2012 Jan; 18(1):146-59. PubMed ID: 21301023 [TBL] [Abstract][Full Text] [Related]
2. 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]
3. 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]
4. 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]
5. 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]
6. A Topological Distance Between Multi-Fields Based on Multi-Dimensional Persistence Diagrams. Ramamurthi Y; Chattopadhyay A IEEE Trans Vis Comput Graph; 2024 Sep; 30(9):5939-5952. PubMed ID: 37703168 [TBL] [Abstract][Full Text] [Related]
7. Visualization of Morse connection graphs for topologically rich 2D vector fields. Szymczak A; Sipeki L IEEE Trans Vis Comput Graph; 2013 Dec; 19(12):2763-72. PubMed ID: 24051843 [TBL] [Abstract][Full Text] [Related]
8. Visual exploration of complex time-varying graphs. Kumar G; Garland M IEEE Trans Vis Comput Graph; 2006; 12(5):805-12. PubMed ID: 17080803 [TBL] [Abstract][Full Text] [Related]
9. Anisotropic Laplace-Beltrami Eigenmaps: Bridging Reeb Graphs and Skeletons. Shi Y; Lai R; Krishna S; Sicotte N; Dinov I; Toga AW Proc IEEE Comput Soc Conf Comput Vis Pattern Recognit; 2008 Jul; 2008():1-7. PubMed ID: 21339850 [TBL] [Abstract][Full Text] [Related]
10. Interactive Visualization for Singular Fibers of Functions f : R³ → R². Sakurai D; Saeki O; Carr H; Wu HY; Yamamoto T; Duke D; Takahashi S IEEE Trans Vis Comput Graph; 2016 Jan; 22(1):945-54. PubMed ID: 26529738 [TBL] [Abstract][Full Text] [Related]
11. Persistent Reeb Graph Matching for Fast Brain Search. Shi Y; Li J; Toga AW Mach Learn Med Imaging; 2014; 8679():306-313. PubMed ID: 25594076 [TBL] [Abstract][Full Text] [Related]
12. Using Foliation Leaves to Extract Reeb Graphs on Surfaces. Wang S; Wang W; Zhao H IEEE Trans Vis Comput Graph; 2023 Apr; 29(4):2117-2131. PubMed ID: 35015643 [TBL] [Abstract][Full Text] [Related]
13. A Topological Similarity Measure Between Multi-Resolution Reeb Spaces. Ramamurthi Y; Agarwal T; Chattopadhyay A IEEE Trans Vis Comput Graph; 2022 Dec; 28(12):4360-4374. PubMed ID: 34101594 [TBL] [Abstract][Full Text] [Related]
14. 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]
15. 3D Surface-Based Geometric and Topological Quantification of Retinal Microvasculature in OCT-Angiography via Reeb Analysis. Zhang J; Kashani AH; Shi Y Med Image Comput Comput Assist Interv; 2019; 11764():57-65. PubMed ID: 33860287 [TBL] [Abstract][Full Text] [Related]
16. Multi-level graph layout on the GPU. Frishman Y; Tal A IEEE Trans Vis Comput Graph; 2007; 13(6):1310-9. PubMed ID: 17968079 [TBL] [Abstract][Full Text] [Related]
17. Joint Graph Layouts for Visualizing Collections of Segmented Meshes. Ren J; Schneider J; Ovsjanikov M; Wonka P IEEE Trans Vis Comput Graph; 2018 Sep; 24(9):2546-2558. PubMed ID: 28920901 [TBL] [Abstract][Full Text] [Related]
18. Relation-Aware Isosurface Extraction in Multifield Data. Nagaraj S; Natarajan V IEEE Trans Vis Comput Graph; 2011 Feb; 17(2):182-191. PubMed ID: 20421685 [TBL] [Abstract][Full Text] [Related]
19. A parallel computing engine for a class of time critical processes. Nabhan TM; Zomaya AY IEEE Trans Syst Man Cybern B Cybern; 1997; 27(5):774-86. PubMed ID: 18263088 [TBL] [Abstract][Full Text] [Related]
20. Fast construction of assembly trees for molecular graphs. Artemova S; Grudinin S; Redon S J Comput Chem; 2011 Jun; 32(8):1589-98. PubMed ID: 21328401 [TBL] [Abstract][Full Text] [Related] [Next] [New Search]