Paper Info
Title
Marching triangle polygonization for efficient surface reconstruction from its distance transform
Abstract
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.
Year
DOI
Venue
2009
10.1007/978-3-642-04397-0_15
DGCI
Keywords
Field
DocType
basic algorithm,new triangle,efficient surface reconstruction,triangle polygonization,new triangles configuration,scanned object,new potential vertex,new method,classic marching triangle algorithm,new polygonization method,surface reconstruction process,complete mesh,surface reconstruction,marching cube,triangle mesh,distance transform,scalar field
Combinatorics,Computer science,Marching tetrahedra,Marching cubes,Marching squares,Distance transform,Triangulation (social science),Point cloud,Triangle mesh,Delaunay triangulation
Conference
Volume
ISSN
ISBN
5810
0302-9743
3-642-04396-8
Citations 
PageRank 
References 
0
0.34
22
Authors
3
Name
Order
Citations
PageRank
Marc Fournier1111.99
Jean-michel Dischler238634.69
dominique bechmann325829.25