|
|
|
|
| LEADER |
01000caa a22002652 4500 |
| 001 |
NLM349677166 |
| 003 |
DE-627 |
| 005 |
20240331233639.0 |
| 007 |
cr uuu---uuuuu |
| 008 |
231226s2024 xx |||||o 00| ||eng c |
| 024 |
7 |
|
|a 10.1109/TVCG.2022.3225526
|2 doi
|
| 028 |
5 |
2 |
|a pubmed24n1358.xml
|
| 035 |
|
|
|a (DE-627)NLM349677166
|
| 035 |
|
|
|a (NLM)36455093
|
| 040 |
|
|
|a DE-627
|b ger
|c DE-627
|e rakwb
|
| 041 |
|
|
|a eng
|
| 100 |
1 |
|
|a Zhang, Wenhua
|e verfasserin
|4 aut
|
| 245 |
1 |
0 |
|a Marching Windows
|b Scalable Mesh Generation for Volumetric Data With Multiple Materials
|
| 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 31.03.2024
|
| 500 |
|
|
|a published: Print-Electronic
|
| 500 |
|
|
|a Citation Status PubMed-not-MEDLINE
|
| 520 |
|
|
|a Volumetric data abounds in medical imaging and other fields. With the improved imaging quality and the increased resolution, volumetric datasets are getting so large that the existing tools have become inadequate for processing and analyzing the data. Here we consider the problem of computing tetrahedral meshes to represent large volumetric datasets with labeled multiple materials, which are often encountered in medical imaging or microscopy optical slice tomography. Such tetrahedral meshes are a more compact and expressive geometric representation so are in demand for efficient visualization and simulation of the data, which are impossible if the original large volumetric data are used directly due to the large memory requirement. Existing methods for meshing volumetric data are not scalable for handling large datasets due to their sheer demand on excessively large run-time memory or failure to produce a tet-mesh that preserves the multi-material structure of the original volumetric data. In this article we propose a novel approach, called Marching Windows, that uses a moving window and a disk-swap strategy to reduce the run-time memory footprint, devise a new scheme that guarantees to preserve the topological structure of the original dataset, and adopt an error-guided optimization technique to improve both geometric approximation error and mesh quality. Extensive experiments show that our method is capable of processing very large volumetric datasets beyond the capability of the existing methods and producing tetrahedral meshes of high quality
|
| 650 |
|
4 |
|a Journal Article
|
| 700 |
1 |
|
|a Yue, Yating
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Pan, Hao
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Chen, Zhonggui
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Wang, Chuan
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Pfister, Hanspeter
|e verfasserin
|4 aut
|
| 700 |
1 |
|
|a Wang, Wenping
|e verfasserin
|4 aut
|
| 773 |
0 |
8 |
|i Enthalten in
|t IEEE transactions on visualization and computer graphics
|d 1996
|g 30(2024), 3 vom: 30. März, Seite 1728-1742
|w (DE-627)NLM098269445
|x 1941-0506
|7 nnns
|
| 773 |
1 |
8 |
|g volume:30
|g year:2024
|g number:3
|g day:30
|g month:03
|g pages:1728-1742
|
| 856 |
4 |
0 |
|u http://dx.doi.org/10.1109/TVCG.2022.3225526
|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 2024
|e 3
|b 30
|c 03
|h 1728-1742
|