|
|
|
|
| LEADER |
01000caa a22002652 4500 |
| 001 |
NLM363984542 |
| 003 |
DE-627 |
| 005 |
20231229123912.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231226s2024 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2023.3327182
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1240.xml
|
| 035 |
|
|
|a (DE-627)NLM363984542
|
| 035 |
|
|
|a (NLM)37906496
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Liu, Guoxi
|e verfasserin
|4 aut
|
| 245 |
1 |
2 |
|a A Task-Parallel Approach for Localized Topological Data Structures
|
| 264 |
|
1 |
|c 2024
|
| 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 Revised 27.12.2023
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Unstructured meshes are characterized by data points irregularly distributed in the Euclidian space. Due to the irregular nature of these data, computing connectivity information between the mesh elements requires much more time and memory than on uniformly distributed data. To lower storage costs, dynamic data structures have been proposed. These data structures compute connectivity information on the fly and discard them when no longer needed. However, on-the-fly computation slows down algorithms and results in a negative impact on the time performance. To address this issue, we propose a new task-parallel approach to proactively compute mesh connectivity. Unlike previous approaches implementing data-parallel models, where all threads run the same type of instructions, our task-parallel approach allows threads to run different functions. Specifically, some threads run the algorithm of choice while other threads compute connectivity information before they are actually needed. The approach was implemented in the new Accelerated Clustered TOPOlogical (ACTOPO) data structure, which can support any processing algorithm requiring mesh connectivity information. Our experiments show that ACTOPO combines the benefits of state-of-the-art memory-efficient (TTK CompactTriangulation) and time-efficient (TTK ExplicitTriangulation) topological data structures. It occupies a similar amount of memory as TTK CompactTriangulation while providing up to 5x speedup. Moreover, it achieves comparable time performance as TTK ExplicitTriangulation while using only half of the memory space
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Iuricich, Federico
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 30(2023), 1 vom: 31. Jan., Seite 1271-1281
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:30
|g year:2023
|g number:1
|g day:31
|g month:01
|g pages:1271-1281
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2023.3327182
|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 30
|j 2023
|e 1
|b 31
|c 01
|h 1271-1281
|