Point-tangent/point-normal B-spline curve interpolation by geometric algorithms

We introduce a novel method to interpolate a set of data points as well as unit tangent vectors or unit normal vectors at the data points by means of a B-spline curve interpolation technique using geometric algorithms. The advantages of our algorithm are that it has a compact representation, it does not require the magnitudes of the tangent vectors or normal vectors, and it has C^2 continuity. We compare our method with the conventional curve interpolation methods, namely, the standard point interpolation method, the method introduced by Piegl and Tiller, which interpolates points as well as the first derivatives at every point, and the piecewise cubic Hermite interpolation method. Examples are provided to demonstrate the effectiveness of the proposed algorithms.

[1]  Nicholas M. Patrikalakis,et al.  Shape Interrogation for Computer Aided Design and Manufacturing , 2002, Springer Berlin Heidelberg.

[2]  W. Boehm,et al.  Bezier and B-Spline Techniques , 2002 .

[3]  Wolfgang Böhm,et al.  A survey of curve and surface methods in CAGD , 1984, Comput. Aided Geom. Des..

[4]  Gerald Farin,et al.  Curves and surfaces for computer aided geometric design , 1990 .

[5]  Bert Jüttler,et al.  Techniques for fair- and shape-preserving surface fitting with tensor-product-B-splines , 1999 .

[6]  Les A. Piegl,et al.  The NURBS Book , 1995, Monographs in Visual Communication.

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

[8]  Gábor Renner,et al.  Advanced surface fitting techniques , 2002, Comput. Aided Geom. Des..

[9]  Takashi Maekawa,et al.  Interpolation by geometric algorithm , 2007, Comput. Aided Des..

[10]  Shi-Min Hu,et al.  A second order algorithm for orthogonal projection onto curves and surfaces , 2005, Comput. Aided Geom. Des..

[11]  Fujio Yamaguchi,et al.  Curves and Surfaces in Computer Aided Geometric Design , 1988, Springer Berlin Heidelberg.

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

[13]  Timothy A. Davis,et al.  Direct methods for sparse linear systems , 2006, Fundamentals of algorithms.

[14]  David Bommes,et al.  Efficient Linear System Solvers for Mesh Processing , 2005, IMA Conference on the Mathematics of Surfaces.

[15]  David H. Douglas,et al.  ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURE , 1973 .

[16]  Guojin Wang,et al.  Constructing iterative non-uniform B-spline curve and surface to fit data points , 2004, Science in China Series : Information Sciences.

[17]  Fengtao Fan,et al.  Subdivision Based Interpolation with Shape Control , 2008 .

[18]  Nicholas M. Patrikalakis,et al.  Geometric design of functional surfaces , 1996, Comput. Aided Des..