Reconstructing B-spline Curves from Point Clouds--A Tangential Flow Approach Using Least Squares Minimization

We present a novel algorithm based on least-squares minimization to approximate point cloud data in 2D plane with a smooth B-spline curve. The point cloud data may represent an open curve with self intersection and sharp corner. Unlike other existing methods, such as the moving least-squares method and the principle curve method, our algorithm does not need a thinning process. The idea of our algorithm is intuitive and simple - we make a B-spline curve grow along the tangential directions at its two end-points following local geometry of point clouds. Our algorithm generates appropriate control points of the fitting B-spline curve in the least squares sense. Although presented for the 2D case, our method can be extended in a straightforward manner to fitting data points by a B-spline curve in higher dimensions

[1]  Hong Yan,et al.  Convergence condition and efficient implementation of the fuzzy curve-tracing (FCT) algorithm , 2004, IEEE Trans. Syst. Man Cybern. Part B.

[2]  G. A. Watson,et al.  A class of methods for fitting a curve or surface to data by minimizing the sum of squares of orthogonal distances , 2003 .

[3]  L. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communications.

[4]  Adam Krzyzak,et al.  Learning and Design of Principal Curves , 2000, IEEE Trans. Pattern Anal. Mach. Intell..

[5]  Hong Yan Fuzzy curve-tracing algorithm , 2001, IEEE Trans. Syst. Man Cybern. Part B.

[6]  Stephen J. Wright,et al.  Numerical Optimization , 2018, Fundamental Statistical Inference.

[7]  Josef Hoschek,et al.  Fundamentals of computer aided geometric design , 1996 .

[8]  Per Christian Hansen,et al.  Rank-Deficient and Discrete Ill-Posed Problems , 1996 .

[9]  H. Pottmann,et al.  Fitting B-Spline Curves to Point Clouds by Squared Distance Minimization , 2006 .

[10]  David Levin,et al.  The approximation power of moving least-squares , 1998, Math. Comput..

[11]  Josef Hoschek,et al.  Intrinsic parametrization for approximation , 1988, Comput. Aided Geom. Des..

[12]  Gabriel Taubin,et al.  An improved algorithm for algebraic curve and surface fitting , 1993, 1993 (4th) International Conference on Computer Vision.

[13]  Paul J. Besl,et al.  Direct construction of polynomial surfaces from dense range images through region growing , 1995, TOGS.

[14]  Kurt Mehlhorn,et al.  Curve reconstruction: connecting dots with good reason , 1999, SCG '99.

[15]  J. Navarro-Pedreño Numerical Methods for Least Squares Problems , 1996 .

[16]  In-Kwon Lee,et al.  Curve reconstruction from unorganized points , 2000, Comput. Aided Geom. Des..

[17]  Hong Qin,et al.  2.5D Active Contour for Surface Reconstruction , 2003, VMV.

[18]  Wenping Wang,et al.  Control point adjustment for B-spline curve approximation , 2004, Comput. Aided Des..

[19]  Helmut Pottmann,et al.  Rotational and helical surface approximation for reverse engineering , 1998, Computing.

[20]  A. Ardeshir Goshtasby,et al.  Grouping and parameterizing irregularly spaced points for curve fitting , 2000, TOGS.

[21]  David Eppstein,et al.  The Crust and the beta-Skeleton: Combinatorial Curve Reconstruction , 1998, Graph. Model. Image Process..

[22]  Prem Kumar Kalra,et al.  Curve and surface reconstruction from points: an approach based on self-organizing maps , 2004, Appl. Soft Comput..