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 scanned objects. It works over the scalar field distance transform of the object to produce the resulting triangle mesh. First we improve the original algorithm in finding new potential vertices in the mesh growing process. Second we modify the Delaunay sphere test on the new triangles. Third we consider new triangles configuration to obtain a more complete mesh. Finally we introduce an edge processing sequence to improve the overall Marching Triangle algorithm. We use a relevant error metric tool 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 scanned objects.
Financed by the National Centre for Research and Development under grant No. SP/I/1/77065/10 by the strategic scientific research and experimental development program:
SYNAT - “Interdisciplinary System for Interactive Scientific and Scientific-Technical Information”.