Fast 3d surface reconstruction from point clouds using graph-based fronts propagation

Authors:
Abdallah El Chakik;Xavier Desquesnes;Abderrahim Elmoataz
Affiliations:
GREYC - UMR CNRS 6972, UCBN, Caen, France;GREYC - UMR CNRS 6972, UCBN, Caen, France;GREYC - UMR CNRS 6972, UCBN, Caen, France
Venue:
ACCV'12 Proceedings of the 11th Asian conference on Computer Vision - Volume Part IV
Year:
2012

Citing 11
Cited 0

Fast Marching Methods

SIAM Review
Implicit and nonparametric shape reconstruction from unorganized data using a variational level set method

Computer Vision and Image Understanding
The power crust

Proceedings of the sixth ACM symposium on Solid modeling and applications
Communicated by Hans-Peter Seidel: Contour-based surface reconstruction using MPU implicit models

Graphical Models
Surface reconstruction from noisy point clouds

SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Reconstruction of solid models from oriented point sets

SGP '05 Proceedings of the third Eurographics symposium on Geometry processing
Poisson surface reconstruction

SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Efficient Surface Reconstruction using Generalized Coulomb Potentials

IEEE Transactions on Visualization and Computer Graphics
Efficient algorithms for image and high dimensional data processing using eikonal equation on graphs

ISVC'10 Proceedings of the 6th international conference on Advances in visual computing - Volume Part II
A nonlinear PDE model for reconstructing a regular surface from sampled data using a level set formulation on triangular meshes

Journal of Computational Physics
Nonlocal Discrete Regularization on Weighted Graphs: A Framework for Image and Manifold Processing

IEEE Transactions on Image Processing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper proposes a surface reconstruction approach that is based on fronts propagation over weighted graphs of arbitrary structure. The problem of surface reconstruction from a set of points has been extensively studied in the literature so far. The novelty of this approach resides in the use of the eikonal equation using Partial difference Equation on weighted graph. It produces a fast algorithm, which is the main contribution of this study. It also presents several examples that illustrate this approach.