Zhang Wenhua, Yue Yating, Pan Hao, Chen Zhonggui, Wang Chuan, Pfister Hanspeter, Wang Wenping
IEEE Trans Vis Comput Graph. 2024 Mar;30(3):1728-1742. doi: 10.1109/TVCG.2022.3225526. Epub 2024 Jan 30.
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.
体数据在医学成像和其他领域大量存在。随着成像质量的提高和分辨率的增加,体数据集变得如此之大,以至于现有的工具已不足以处理和分析这些数据。在这里,我们考虑计算四面体网格以表示带有标记的多种材料的大体数据集的问题,这在医学成像或显微镜光学切片断层扫描中经常遇到。这样的四面体网格是一种更紧凑且更具表现力的几何表示形式,因此对于数据的高效可视化和模拟很有需求,如果直接使用原始的大体数据,由于内存需求大,这是不可能实现的。现有的体数据网格化方法在处理大型数据集时不可扩展,因为它们对运行时内存的需求过大,或者无法生成保留原始体数据多材料结构的四面体网格。在本文中,我们提出了一种名为“行进窗口”的新颖方法,该方法使用移动窗口和磁盘交换策略来减少运行时内存占用,设计一种新方案以确保保留原始数据集的拓扑结构,并采用误差引导优化技术来改善几何近似误差和网格质量。大量实验表明,我们的方法能够处理现有方法无法处理的非常大的体数据集,并生成高质量的四面体网格。