Marching triangle polygonization for efficient surface reconstruction from its distance transform

Authors:
Marc Fournier;Jean-Michel Dischler;Dominique Bechmann
Affiliations:
Image Sciences, Computer Sciences and Remote Sensing Laboratory, LSIIT, UMR, CNRS, Louis Pasteur University, Strasbourg, France;Image Sciences, Computer Sciences and Remote Sensing Laboratory, LSIIT, UMR, CNRS, Louis Pasteur University, Strasbourg, France;Image Sciences, Computer Sciences and Remote Sensing Laboratory, LSIIT, UMR, CNRS, Louis Pasteur University, Strasbourg, France
Venue:
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Year:
2009

Citing 13
Cited 1

Marching cubes: A high resolution 3D surface construction algorithm

SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques
A Method for Registration of 3-D Shapes

IEEE Transactions on Pattern Analysis and Machine Intelligence - Special issue on interpretation of 3-D scenes—part II
A fast triangle-triangle intersection test

Journal of Graphics Tools
Implicit surface-based geometric fusion

Computer Vision and Image Understanding - Special issue on CAD-based computer vision
Feature sensitive surface extraction from volume data

Proceedings of the 28th annual conference on Computer graphics and interactive techniques
The Ball-Pivoting Algorithm for Surface Reconstruction

IEEE Transactions on Visualization and Computer Graphics
Curvature-Dependent Triangulation of Implicit Surfaces

IEEE Computer Graphics and Applications
Simplification and Repair of Polygonal Models Using Volumetric Techniques

IEEE Transactions on Visualization and Computer Graphics
The asymptotic decider: resolving the ambiguity in marching cubes

VIS '91 Proceedings of the 2nd conference on Visualization '91
Curvature Dependent Polygonization of Implicit Surfaces

SIBGRAPI '04 Proceedings of the Computer Graphics and Image Processing, XVII Brazilian Symposium
Dual Contouring with Topology-Preserving Simplification Using Enhanced Cell Representation

VIS '04 Proceedings of the conference on Visualization '04
3D distance transform adaptive filtering for smoothing and denoising triangle meshes

Proceedings of the 4th international conference on Computer graphics and interactive techniques in Australasia and Southeast Asia
A new vector field distance transform and its application to mesh processing from 3D scanned data

The Visual Computer: International Journal of Computer Graphics

3D surface reconstruction of objects by using stereoscopic viewing

ASM'10 Proceedings of the 4th international conference on Applied mathematics, simulation, modelling

Quantified Score

Hi-index	0.00

Visualization

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.