Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing
Improving the robustness and accuracy of the marching cubes algorithm for isosurfacing
复制标题
DOI：
10.1109/tvcg.2003.1175094
复制
发表时间：
2003-01-01
影响因子：
5.2
通讯作者：
Brodlie, K
中科院分区：
文献类型：
--
作者：
Lopes, A;Brodlie, K
本文提出了对等值曲面的 Marching Cubes 算法的修改，旨在改进每个网格单元内部表面的表示。我们的目标是创建一种表示，该表示可以正确模拟单元内三线性插值的拓扑，并且在数据和阈值的扰动下具有鲁棒性。为了实现这一目标，我们确定了细胞内部的少数对表面定义至关重要的关键点。这使我们能够有效地表示可能出现的不同拓扑，包括“隧道”的可能性。当数据和阈值发生变化时，表面在视觉上是连续的，因此该表示是稳健的。每个内部点都位于等值面上。最后，我们新方法的一个主要特点是对细胞内部的多边形进行三角测量的系统方法。
This paper proposes a modification of the Marching Cubes algorithm for isosurfacing, with the intent of improving the representation of the surface in the interior of each grid cell. Our objective is to create a representation which correctly models the topology of the trilinear interpolant within the cell and which is robust under perturbations of the data and threshold value. To achieve this, we identify a small number of key points in the cell interior that are critical to the surface definition. This allows us to efficiently represent the different topologies that can occur, including the possibility of "tunnels." The representation is robust in the sense that the surface is visually continuous as the data and threshold change in value. Each interior point lies on the isosurface. Finally, a major feature of our new approach is the systematic method of triangulating the polygon in the cell interior.