Optimization and Augmentation for Data Parallel Contour Trees

Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. However, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - 28(2022), 10 vom: 08. Okt., Seite 3471-3485
1. Verfasser: Carr, Hamish A (VerfasserIn)
Weitere Verfasser: Rubel, Oliver, Weber, Gunther H, Ahrens, James P
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2022
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article Research Support, U.S. Gov't, Non-P.H.S. Research Support, Non-U.S. Gov't
LEADER 01000naa a22002652 4500
001 NLM322412528
003 DE-627
005 20231225182003.0
007 cr uuu---uuuuu
008 231225s2022 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2021.3064385  |2 doi 
028 5 2 |a pubmed24n1074.xml 
035 |a (DE-627)NLM322412528 
035 |a (NLM)33684039 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Carr, Hamish A  |e verfasserin  |4 aut 
245 1 0 |a Optimization and Augmentation for Data Parallel Contour Trees 
264 1 |c 2022 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Completed 08.09.2022 
500 |a Date Revised 10.09.2022 
500 |a published: Print-Electronic 
500 |a Citation Status MEDLINE 
520 |a Contour trees are used for topological data analysis in scientific visualization. While originally computed with serial algorithms, recent work has introduced a vector-parallel algorithm. However, this algorithm is relatively slow for fully augmented contour trees which are needed for many practical data analysis tasks. We therefore introduce a representation called the hyperstructure that enables efficient searches through the contour tree and use it to construct a fully augmented contour tree in data parallel, with performance on average 6 times faster than the state-of-the-art parallel algorithm in the TTK topological toolkit 
650 4 |a Journal Article 
650 4 |a Research Support, U.S. Gov't, Non-P.H.S. 
650 4 |a Research Support, Non-U.S. Gov't 
700 1 |a Rubel, Oliver  |e verfasserin  |4 aut 
700 1 |a Weber, Gunther H  |e verfasserin  |4 aut 
700 1 |a Ahrens, James P  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g 28(2022), 10 vom: 08. Okt., Seite 3471-3485  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g volume:28  |g year:2022  |g number:10  |g day:08  |g month:10  |g pages:3471-3485 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2021.3064385  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |d 28  |j 2022  |e 10  |b 08  |c 10  |h 3471-3485