A fast algorithm for approximate surface reconstruction from sampled points

Authors:
B. Repnik;B. Alik
Affiliations:
University of Maribor, Faculty of Electrical Engineering and Computer Science, Smetanova 17, SI-2000 Maribor, Slovenia;University of Maribor, Faculty of Electrical Engineering and Computer Science, Smetanova 17, SI-2000 Maribor, Slovenia
Venue:
Advances in Engineering Software
Year:
2012

Citing 18
Cited 0

Surface reconstruction from unorganized points

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
Three-dimensional alpha shapes

ACM Transactions on Graphics (TOG)
Boundaries through scattered points of unknown density

Graphical Models and Image Processing
A volumetric method for building complex models from range images

SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
A new Voronoi-based surface reconstruction algorithm

Proceedings of the 25th annual conference on Computer graphics and interactive techniques
Analysis of an Algorithm for Finding Nearest Neighbors in Euclidean Space

ACM Transactions on Mathematical Software (TOMS)
Geometric structures for three-dimensional shape representation

ACM Transactions on Graphics (TOG)
The Ball-Pivoting Algorithm for Surface Reconstruction

IEEE Transactions on Visualization and Computer Graphics
A greedy Delaunay-based surface reconstruction algorithm

The Visual Computer: International Journal of Computer Graphics
Spectral surface reconstruction from noisy point clouds

Proceedings of the 2004 Eurographics/ACM SIGGRAPH symposium on Geometry processing
Geometric Modeling

Geometric Modeling
Robust reconstruction of watertight 3D models from non-uniformly sampled point clouds without normal information

SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Poisson surface reconstruction

SGP '06 Proceedings of the fourth Eurographics symposium on Geometry processing
Multilevel streaming for out-of-core surface reconstruction

SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
A topological approach for surface reconstruction from sample points

The Visual Computer: International Journal of Computer Graphics
A practical approach to the 2D incremental nearest-point problem suitable for different point distributions

Pattern Recognition
Comparative study of different digitization techniques and their accuracy

Computer-Aided Design
The power crust, unions of balls, and the medial axis transform

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new algorithm for fast approximate surface reconstruction from sampled points. This algorithm works over three steps. Firstly, a raw rectangular surface is obtained, and then this surface is triangulated and smoothed in the second step. The surface vertices are fitted to the nearest input points at the end. The algorithm is very fast, numerically stable, easy to implement, and it constructs a watertight surface. In the experimental section, the algorithm is compared with other available algorithms (algorithm from CGAL library, Power Crust, Tight cocone, and Poisson reconstruction) in regards to the spent CPU time. Finally, an error of the obtained approximate surface is empirically estimated.