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

被引:92
作者
OuYang, D [1 ]
Feng, HY [1 ]
机构
[1] Univ Western Ontario, Dept Mech & Mat Engn, London, ON N6A 5B9, Canada
基金
加拿大自然科学与工程研究理事会;
关键词
normal vector; point cloud data; Voronoi diagram; local Voronoi mesh; directional tangent vectors;
D O I
10.1016/j.cad.2004.11.005
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
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. (c) 2004 Elsevier Ltd. All rights reserved.
引用
收藏
页码:1071 / 1079
页数:9
相关论文
共 25 条
[1]   Surface reconstruction using umbrella filters [J].
Adamy, U ;
Giesen, J ;
John, M .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 21 (1-2) :63-86
[2]   Surface reconstruction by Voronoi filtering [J].
Amenta, N ;
Bern, M .
DISCRETE & COMPUTATIONAL GEOMETRY, 1999, 22 (04) :481-504
[3]   The power crust, unions of balls, and the medial axis transform [J].
Amenta, N ;
Choi, SH ;
Kolluri, RK .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 19 (2-3) :127-153
[4]  
[Anonymous], 2000, P 16 ANN S COMP GEOM
[5]   R-regular shape reconstruction from unorganized points [J].
Attali, D .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 1998, 10 (04) :239-247
[6]   The Quickhull algorithm for convex hulls [J].
Barber, CB ;
Dobkin, DP ;
Huhdanpaa, H .
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 1996, 22 (04) :469-483
[7]   The ball-pivoting algorithm for surface reconstruction [J].
Bernardini, F ;
Mittleman, J ;
Rushmeier, H ;
Silva, C ;
Taubin, G .
IEEE TRANSACTIONS ON VISUALIZATION AND COMPUTER GRAPHICS, 1999, 5 (04) :349-359
[8]   Smooth surface reconstruction via natural neighbour interpolation of distance functions [J].
Boissonnat, JD ;
Cazals, F .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2002, 22 (1-3) :185-203
[9]   GEOMETRIC STRUCTURES FOR 3-DIMENSIONAL SHAPE REPRESENTATION [J].
BOISSONNAT, JD .
ACM TRANSACTIONS ON GRAPHICS, 1984, 3 (04) :266-286
[10]   Natural neighbor coordinates of points on a surface [J].
Boissonnat, JD ;
Cazals, F .
COMPUTATIONAL GEOMETRY-THEORY AND APPLICATIONS, 2001, 19 (2-3) :155-173