A Geometric Convection Approach of 3-D Reconstruction

Loading...
Thumbnail Image
Date
2003
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
This paper introduces a fast and efficient algorithm for surface reconstruction. As many algorithms of this kind, it produces a piecewise linear approximation of a surface S from a finite, sufficiently dense, subset of its points. Originally, the starting point of this work does not come from the computational geometry field. It is inspired by an existing numerical scheme of surface convection developed by Zhao, Osher and Fedkiw. We have translated this scheme to make it depend on the geometry of the input data set only, and not on the precision of some grid around the surface. Our algorithm deforms a closed oriented pseudo-surface embedded in the 3D Delaunay triangulation of the sampled points, and the reconstructed surface consists of a set of oriented facets located in this 3D Delaunay triangulation. This paper provides an appropriate data structure to represent a pseudo-surface, together with operations that manage deformations and topological changes. The algorithm can handle surfaces with boundaries, surfaces of high genus and, unlike most of the other existing schemes, it does not involve a global heuristic. Its complexity is that of the 3D Delaunay triangulation of the points. We present some results of the method, which turns out to be efficient even on noisy input data.
Description

        
@inproceedings{
:10.2312/SGP/SGP03/218-229
, booktitle = {
Eurographics Symposium on Geometry Processing
}, editor = {
Leif Kobbelt and Peter Schroeder and Hugues Hoppe
}, title = {{
A Geometric Convection Approach of 3-D Reconstruction
}}, author = {
Chaine, Raphaƫlle
}, year = {
2003
}, publisher = {
The Eurographics Association
}, ISSN = {
1727-8384
}, ISBN = {
3-905673-06-1
}, DOI = {
/10.2312/SGP/SGP03/218-229
} }
Citation