On the normal vector estimation for point cloud data from smooth surfaces

Authors:
Daoshan OuYang;Hsi-Yung Feng
Affiliations:
Department of Mechanical and Materials Engineering, The University of Western Ontario, London, Ont., Canada N6A 5B9;Department of Mechanical and Materials Engineering, The University of Western Ontario, London, Ont., Canada N6A 5B9
Venue:
Computer-Aided Design
Year:
2005

Citing 13
Cited 11

Segmentation and Classification of Range Images

IEEE Transactions on Pattern Analysis and Machine Intelligence
Surface reconstruction from unorganized points

SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
The quickhull algorithm for convex hulls

ACM Transactions on Mathematical Software (TOMS)
r-regular shape reconstruction from unorganized points

Computational Geometry: Theory and Applications - special issue on applied computational geometry
A simple algorithm for homeomorphic surface reconstruction

Proceedings of the sixteenth annual symposium on Computational geometry
On surface normal and Gaussian curvature approximations given data sampled from a smooth surface

Computer Aided Geometric Design
Geometric structures for three-dimensional shape representation

ACM Transactions on Graphics (TOG)
Numerical Recipes in C++: the art of scientific computing

Numerical Recipes in C++: the art of scientific computing
Curvature-Augmented Tensor Voting for Shape Inference from Noisy 3D Data

IEEE Transactions on Pattern Analysis and Machine Intelligence
Surface reconstruction using umbrella filters

Computational Geometry: Theory and Applications - Special issue on: Sixteenth European Workshop on Computational Geometry (EUROCG-2000)
The Ball-Pivoting Algorithm for Surface Reconstruction

IEEE Transactions on Visualization and Computer Graphics
Ray Tracing Point Sampled Geometry

Proceedings of the Eurographics Workshop on Rendering Techniques 2000
Smooth surface reconstruction via natural neighbour interpolation of distance functions

Computational Geometry: Theory and Applications

Voronoi-based variational reconstruction of unoriented point sets

SGP '07 Proceedings of the fifth Eurographics symposium on Geometry processing
A global clustering approach to point cloud simplification with a specified data reduction ratio

Computer-Aided Design
Point-cloud simplification with bounded geometric deviations

International Journal of Computer Applications in Technology
From laser point clouds to surfaces: Statistical nonparametric methods for three-dimensional reconstruction

Computer-Aided Design
Trash removal algorithm for fast construction of the elliptic Gabriel graph using Delaunay triangulation

Computer-Aided Design
Automatic least-squares projection of points onto point clouds with applications in reverse engineering

Computer-Aided Design
Elliptic Gabriel graph for finding neighbors in a point set and its application to normal vector estimation

Computer-Aided Design
Comparison of surface normal estimation methods for range sensing applications

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation
Technical Section: Robust normal estimation for point clouds with sharp features

Computers and Graphics
Technical Section: Shape classification and normal estimation for non-uniformly sampled, noisy point data

Computers and Graphics
An adaptive normal estimation method for scanned point clouds with sharp features

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reliable estimation of the normal vector at a discrete data point in a scanned cloud data set is essential to the correct implementation of modern CAD/CAM technologies when the continuous CAD model representation is not available. A new method based on fitted directional tangent vectors at the data point has been developed to determine its normal vector. A local Voronoi mesh, based on the 3D Voronoi diagram and the proposed mesh growing heuristic rules, is first created to identify the neighboring points that characterize the local geometry. These local Voronoi mesh neighbors are used to fit a group of quadric curves through which the directional tangent vectors are obtained. The normal vector is then determined by minimizing the variance of the dot products between a normal vector candidate and the associated directional tangent vectors. Implementation results from extensive simulated and practical point cloud data sets have demonstrated that the present method is robust and estimates normal vectors with reliable consistency in comparison with the existing plane fitting, quadric surface fitting, triangle-based area weighted average, and triangle-based angle weighted average methods.