Surface Reconstruction: An Improved Marching Triangle Algorithm for Scalar and Vector Implicit Field Representations
Marc Fournier · 2009
In this paper we propose a new polygonization method based on the classic Marching Triangle algorithm. It is an improved and efficient version of the basic algorithm which produces a complete mesh without any cracks. Our method is useful in the surface reconstruction process of digitized objects. It works over the discrete distance transform of the object to produce the resulting triangle mesh. The new algorithm is also adapted to a recently introduced vector field distance transform model which is more accurate than the classic scalar field discrete distance transform of meshes. Our polygonization method is simplified and it produces better results compared to Marching Triangle basic algorithm while working on the vector field distance transform model. We use relevant error metric tools to compare results and show our new method is more accurate than Marching Cube which is the most widely used triangulation algorithm in the surface reconstruction process of digitized objects.