135 related articles for article (PubMed ID: 31403428)
1. 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]
2. Visually defining and querying consistent multi-granular clinical temporal abstractions.
Combi C; Oliboni B
Artif Intell Med; 2012 Feb; 54(2):75-101. PubMed ID: 22177662
[TBL] [Abstract][Full Text] [Related]
3. Mapping high-fidelity volume rendering for medical imaging to CPU, GPU and many-core architectures.
Smelyanskiy M; Holmes D; Chhugani J; Larson A; Carmean DM; Hanson D; Dubey P; Augustine K; Kim D; Kyker A; Lee VW; Nguyen AD; Seiler L; Robb R
IEEE Trans Vis Comput Graph; 2009; 15(6):1563-70. PubMed ID: 19834234
[TBL] [Abstract][Full Text] [Related]
4. Kd-Jump: a path-preserving stackless traversal for faster isosurface raytracing on GPUs.
Hughes DM; Lim IS
IEEE Trans Vis Comput Graph; 2009; 15(6):1555-62. PubMed ID: 19834233
[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. 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]
7. cuRnet: an R package for graph traversing on GPU.
Bonnici V; Busato F; Aldegheri S; Akhmedov M; Cascione L; Carmena AA; Bertoni F; Bombieri N; Kwee I; Giugno R
BMC Bioinformatics; 2018 Oct; 19(Suppl 10):356. PubMed ID: 30367572
[TBL] [Abstract][Full Text] [Related]
8. 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]
9. VS: a surface-based system for topological analysis, quantization and visualization of voxel data.
Cohen I; Gordon D
Med Image Anal; 2009 Apr; 13(2):245-56. PubMed ID: 19083261
[TBL] [Abstract][Full Text] [Related]
10. An evaluation of multi-probe locality sensitive hashing for computing similarities over web-scale query logs.
Cormode G; Dasgupta A; Goyal A; Lee CH
PLoS One; 2018; 13(1):e0191175. PubMed ID: 29346410
[TBL] [Abstract][Full Text] [Related]
11. Comparative Analysis of Merge Trees Using Local Tree Edit Distance.
Sridharamurthy R; Natarajan V
IEEE Trans Vis Comput Graph; 2023 Feb; 29(2):1518-1530. PubMed ID: 34699362
[TBL] [Abstract][Full Text] [Related]
12. 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]
13. Automatic transfer function generation using contour tree controlled residue flow model and color harmonics.
Zhou J; Takatsuka M
IEEE Trans Vis Comput Graph; 2009; 15(6):1481-8. PubMed ID: 19834224
[TBL] [Abstract][Full Text] [Related]
14. ISP: an optimal out-of-core image-set processing streaming architecture for parallel heterogeneous systems.
Ha LK; Krüger J; Dihl Comba JL; Silva CT; Joshi S
IEEE Trans Vis Comput Graph; 2012 Jun; 18(6):838-51. PubMed ID: 22291156
[TBL] [Abstract][Full Text] [Related]
15. Content-based retrieval of historical Ottoman documents stored as textual images.
Saykol E; Sinop AK; Güdükbay U; Ulusoy O; Cetin AE
IEEE Trans Image Process; 2004 Mar; 13(3):314-25. PubMed ID: 15376924
[TBL] [Abstract][Full Text] [Related]
16. 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]
17. Fast and memory efficient 2-D connected components using linked lists of line segments.
De Bock J; Philips W
IEEE Trans Image Process; 2010 Dec; 19(12):3222-31. PubMed ID: 20550991
[TBL] [Abstract][Full Text] [Related]
18. An alternative database approach for management of SNOMED CT and improved patient data queries.
Campbell WS; Pedersen J; McClay JC; Rao P; Bastola D; Campbell JR
J Biomed Inform; 2015 Oct; 57():350-7. PubMed ID: 26305513
[TBL] [Abstract][Full Text] [Related]
19. Interactive Exploration and Analysis of Large-Scale Simulations Using Topology-Based Data Segmentation.
Bremer PT; Weber G; Tierny J; Pascucci V; Day MS; Bell JB
IEEE Trans Vis Comput Graph; 2011 Sep; 17(9):1307-24. PubMed ID: 21149885
[TBL] [Abstract][Full Text] [Related]
20. Efficient evaluation of radial queries using the target tree.
Morse M; Patel JM; Grosky WI
Int J Bioinform Res Appl; 2007; 3(1):24-41. PubMed ID: 18048171
[TBL] [Abstract][Full Text] [Related]
[Next] [New Search]
