1 Introduction
Parametric curve and surface approximation of Bsplines, corresponding to parameter estimated of data points depending on chord length, centripetal, or base curves and surfaces parameterizations, based on numerical optimization using newton type methods, and minimization of error in the least square sense, is well studied
[1, 2, 3, 4, 5]. Achieving of high accuracy in fitting to the constraints of the parameters, cause to increase the degree of the curve and surface. A high degree fit can lower the shape preserving and visually pleasing nature [6, 7, 8, 9, 10, 11], and increases computational cost with the modelled curve and surface further in geometric design. In this context, we present algorithm for fitting a cubic bspline curve to data points in three or higher dimensional space, with properties of continuity naturally upto, and agrees with tangents at data points related to shape preserving and visually pleasing interpolation at projections in corresponding coordinate planes.
This paper is organized as follows. In Section 2 we discuss basic concepts and terminologies used in this paper. Algorithms and rules for construction of curve fitting are discussed in Section 3. Related work is discussed in Section 4. Results of experimentation is presented in Section 5. Finally, this paper is concluded in Section 6.
2 Basic concepts and terminologies
In this Section, we discuss basic concepts and terminologies, necessary in presenting our algorithm of Bspline curve fitting in Section 3.
2.1 Cardinal Spline
Cardinal spline is a cubic hermit class of spline. Hermit interpolation uses cubic polynomials to interpolate consecutive data points in pairs. An equality of the tangent values, of the individual segments ending and starting at every intermediate data point is ensured. Thus, a piecewise cubic curve interpolating the data points, with
continuity at the junctions is obtained. A cardinal spline, defines equality of tangent values at every intermediate data point, by specifying, the tangent at every point. The tangent, at every intermediate data point, is specified to be equal to a constant multiple of the vector, using the next point as the end point, and the previous point as the start point for the corresponding vectors. CatmullRom spline
[11] is a specific cardinal spline that uses a fixed value of 0.5 for the constant.For, a cardinal spline to pass through, a sequence (, , …, ), of (+1) data or control points, the tangent at , is expressed as, (  ), where is the constant, and is considered to represent the tension parameter of the curve segment. The parametric equation, = + + + , of a curve segment, for range of parameter , is defined, for the curve between control points to . The geometry matrix, for the curve is derived using the control points, , , , and . The boundary conditions, used are , (0)=, (1)=, (0)=(), and (1)=(), based on the coordinates and tangent values, at control points, , and . The control points , and , are required to be repeated, in the sequence of control points, to generate points for the curve segments between control points to , and to , respectively. The parametric equation for the th curve segment is expressed as,
(1) 
where, matrix M=, corresponds to the geometry matrix (GM) of the curve.
2.2 Bezier Curve
Bezier curve is an approximating spline, since the control points representing the geometric description of the curve are not required to be points on the curve. Bezier curves are constructed using any number of control points. The degree of a bezier curve is one less than the number of control points. A set of bernstein polynomials are used for the basis functions of bezier curves.
A cubic bezier curve is defined using a sequence (, , , ) of four control points. Using the basis function, for th control point , , the parametric equation of the curve, on parameter , is of the form, = + 3 + + . In matrix form, this is expressed as,
(2) 
where, matrix M=, corresponds to the geometry matrix (GM) of the curve.
Based on Equation 2, we have =, and =, or the control points at the beginning and end, are points on the curve. Further, the tangents at the end of the parameter values, or the first derivatives at respective values, that could be seen to be, are =, and =. A piecewise cubic curve of continuity at the junctions, can be constructed using cubic bezier curve segments, by ensuring equality of the respective tangents, similar to that of cardinal splines. Thus, for any piecewise cubic curve, a bezier curve segment, with tuple of control points (, , , ), to approximate a cardinal curve segment, from corresponding control point to , requires =, =, = + (  ), and =  (  ).
2.3 Bspline Curve
Bspline curves use a geometric representation to approximate curves of specific degree, composed of a fixed number of curve segments of that degree in a given order. Bspline curves identical to piecewise cubic bezier curves are possible to be constructed using the control points of the bezier curves representing the corresponding segments in the respective piecewise curves. The representation using a cubic bspline curve, for a curve identical in shape of continuous piecewise cubic bezier curve, improves the level of continuity of the composite curve. The representation obtained using bspline curve becomes continuous, or continuity upto curvatures, is raised over the existing continuity at the level of slopes.
For, a continuous piecewise bezier curve with sequence (, , …, ) of +1 control points, such that a sequence (, , , ) of every four control points, subsequent to every fourth control point from the start index of the previous sequence, represents a piece which is a cubic bezier curve, i.e, is of the form =, where , can also represent the sequence of control points for a cubic bspline curve. The bspline curve of cubic degree, with sequence (, , …, ) of the control points, with order =3+1=4, then describes (+2), continuous curve segments, where each curve segment is computed with bspline basis functions, for every four control points, subsequent to every second control point from the start index of the previous sequence and in the sequence. The parameter range for the th segment, is specified, as 1 . The recursively defined basis functions for bspline curve of the form, = , with (+2), based on Carl de Boor’s [12, 13] expression, is as the follows,
(3) 
where,

(0 ) are called knot values

= 0 if ;

= if ;

= if ;
2.4 Dominant Point
A dominant point is an element of a set of the given data points, that is considered to dominate the shape characteristic of a bspline curve approximating the corresponding set of data points [4]. A dominant point set contains dominant points, and is a subset of the given set of all data points, such that the bspline curve approximating the subset of the points has an error within a given bound, compared to the curve approximating the given set of all data points. The complement of a dominant point set, is a set obtained by subtraction of the dominant point set from the set of all data points.
2.5 Square Error for Dominant Point
The error due to approximation of a bspline curve using a set of dominant point could be computed as square error corresponding to the complement of the dominant point set. The corresponding points, for the elements in the complement of the dominant point set, on the approximating curve could be computed, based on respective parameter values in the piecewise curves. The elements in the dominant point set, could be arranged in a list, based on the relative order of every pair of points, in the list of all given points. A list of indices mapping to elements in a complement of dominant point set, is possible, between a pair of indices corresponding to two consecutive dominant points. Such a list is of length zero to any positive number, and square error for dominant points is produced only by every such list. The error due to an element of such a list, is computed about a point with appropriate parameter on the piecewise cubic bezier curve between the consecutive and corresponding dominant points. The parameter value of the corresponding point on the curve is computed, based on the projection of the point on straight line joining the respective dominant points. The corresponding point is computed from the parameter value evaluated as the ratio of the projected length of the line joining the point with the dominant point representing the source of the parameter of the piecewise curve, on the line joining the dominant points, to the length of the line joining the consecutive dominant points.
2.6 Turn Angle
Turn angle for three consecutive data points in is produced by the angle, by which line joining the first two points are to be rotated about the second point, from the straight line joining them, to reach to the third point. Turn angle , at th vertex, is computed using the following expression:
(4) 
where,

: Represents coordinate of
th point, as an ordered pair (
,), of independent coordinate , and dependent coordinate . 
: 

: 
The turn angle for point , is the exterior angle of corresponding to the triangle .
2.7 Selection and Partition of Dominant Point
Dominant point set of a given cardinality are selected by minimizing square error for complement of dominant point set. For a dominant point set of size , from a given point set of size , the square error, is expressed as,
(5) 
where,

: It is a list of indices corresponding to the all points, mapping to the dominant points.

: It is the th point in the list of input data points, which is not contained in corresponding list of dominant points, and is relevant in between the elements and in .

: It is a mapping of the point , on the piecewise curve between dominant points and .

: It returns the element next of in list of indices of dominant points.
In order, to minimize the square error, due to dominant points, we modify an initial guess, to reach to local minima. We use the following conditions in order of nonincreasing priority for a good guess. We use associative array of turn angles and indices of all data points, sorted in descending order on turn angle.

Select first points in the sorted order from array , as primary dominant points.

Select points with at least one previous and one next vertices of each of the primary dominant points, from order of given input data points, as support dominant points.

Select remaining () points, from array , in the sorted order, subsequent to index in the array, as secondary dominant points.
We, minimize the error , due to dominant points, from an initial guess, by selection and deselection of additional points, until any minimal error. Towards the objective to minimize error, we select a dominant point from a pair of dominant points, that give rise to maximal error among all pairs, and deselect a dominant point from a pair of dominant points with minimal error, and recompute the new error. We update the dominant points and the corresponding error of to , if is lower than . We stop at selection of dominant points at the step when no update yields any improvement of the error.
Selection of dominant points from input data points in Figure 1.a, is shown in Figure 1.b. Point indices 1, and +3, correspond to primary dominant points, based on ordering of turn angles. Point indices , and 2, and point index +4, correspond to support dominant points for points with indices 1, and +3, respectively. Square error is included for points with indices +1, and +2, corresponding to computation using the points.
2.8 Corresponding Coordinate Planes
Corresponding coordinate planes are produced by two independent systems, representing affine maps to respective planar curves, from curves in . Corresponding coordinate planes of an system, is a pair of coordinate planes, using two distinct pairs of its coordinate axis, with any common coordinate axis, as the independent coordinate, in respective systems. A pair of corresponding coordinate planes of an system, with coordinate axes , , and , are systems of coordinate axes with , and coordinate axes with .
2.9 Merge rule for Control Points in lower dimension to higher dimension
We merge coordinates of control points of piecewise bezier curve segments in corresponding coordinate planes, to obtain coordinates of control points for the respective curve segments in . The curve in the system, or in the higher dimension, is represented using the control points of the curve in the corresponding system.
For tuple (, , , ) of control points in coordinate plane and axes with , and tuple (, , , ) of control points in coordinate plane and axes with , the following steps are considered:

Compute equals where is difference in coordinate of point and , is difference in coordinate of point and , and equals where is difference in coordinate of point and , is difference in coordinate of point and . Thus, is the signed magnitude of arithmetic mean of the intervals in the independent coordinates of the (+1)th point with the th point in the coordinate planes and , and is the signed magnitude of arithmetic mean of the intervals in the independent coordinates of the (+2)th point with the (+3)th point in the coordinate planes and .

Generate new point with coordinate equals sum of and coordinate of point , on line joining points and , and new point with coordinate equals sum of and coordinate of point , on line joining points and .

Generate new point with coordinate equals sum of and coordinate of point , on line joining points and , and new point with coordinate equals sum of and coordinate of point , on line joining points and .

Collect and , coordinates of point , and coordinate of point , to obtain coordinate of higher dimensional point , and collect and , coordinates of point , and coordinate of point , to obtain coordinate of higher dimensional point .

Collect and , coordinates of point , and coordinate of point , to obtain coordinate of higher dimensional point , and collect and , coordinates of , and coordinate of , to obtain coordinate of higher dimensional point .

The tuple (, , , ), correspond to control points, for the higher dimensional cubic bezier curve.
The merge operation is applied using the control points only. A point coordinate (, , ) of a control point in the three dimensional space, is obtained from coordinates (, ), and (, ), of control points in the corresponding coordinate planes. The operation thus requires the independent coordinates for the control points in respective pairs, on the corresponding coordinate planes, to be equal. This holds automatically, for every first and fourth control point, of every cubic bezier curve piece, for the pair of piecewise bezier curves, on the corresponding coordinate planes. The reason for this is, these points correspond to data points, and are points on the planar curves, due to the interpolation only. The second and the third control points for the curves are computed, using constraints on the tangent vectors at end points of the curve pieces and equality of tangents between successive pieces, at the data points, representing the junctions of the curve pieces. Equality for independent coordinates for the second and the third points does not hold, automatically, and their coordinates are required to be constrained to achieve equality. The independent coordinates of the second control points of the curves and the third control points of the curves on the pair of coordinate planes could be fixed to single values. They could be made to impact only the magnitudes of the tangents proportionately, with no change to the directions, at respective start and end points of the curve pieces in the piecewise curves, on the corresponding planes.
Fixing a value for independent coordinate of the second control point, at arithmetic mean of the intervals in the independent coordinates of the second point from the first point on the pair of coordinate planes, about the first control point, could be considered, in case of update in the second control point. Similarly, fixing a value for independent coordinate of the third control point, at arithmetic mean of the intervals in the independent coordinates of the third point from the fourth point on the pair of coordinate planes, about the fourth control point, could be considered, in case of update in the third control point. This would share any impact on shape preserving property due to change in magnitudes in the tangents at the data points, based on interpolation using the underlying cardinal spline equally, among the curves on the corresponding coordinate planes. The first step of the merge operation, computes this signed magnitude of arithmetic mean, from the intervals in the independent coordinates, on the corresponding coordinate planes. In order to preserve the direction of the tangents, at the corresponding first and fourth points of the curve pieces, identical as before, the dependent coordinate of the respective second and third control points, are computed, on the lines joining the first and second control point, and the third and the fourth control point, respectively. The dependent coordinates are computed using the corresponding values of the independent coordinates, that is being fixed. The second and the third step of the merge operation, compute the direction preserving, second and third control points, using the independent coordinates computed at the first step of the merge operation, on the first and the second coordinate planes, respectively. The equality of the tangent values at last control point of a piece and first control point of the next piece, that is required to be satisfied, at the junction point of the curve pieces for continuity, is automatically satisfied. In this case, it becomes possible, due to selection of arithmetic mean for computing the independent coordinates, from the coordinates of the control points on the respective coordinate planes. The fourth and fifth step of the merge operation, copies the respective coordinates, of the first and second coordinate planes respectively, into the coordinates of the three dimensional control points. The control points of cubic bezier curve piece in the three dimensional space, is obtained by merging of control points of the curve of the corresponding coordinate planes at the end of the sixth step.
Merging of control points of curve in system with coordinate axes (, , , ), is possible by merging curves from corresponding planes , , and , or systems with coordinate axes (, ), (, ), and (, ), respectively. Using the algorithm to merge control points of corresponding coordinate planes, discussed in this section, merging is required to be computed, for the planes with , and with , separately, in this case. However, for target system , in contrast to of before, the independent coordinates for the second, and the third control points, are required to be fixed, using arithmetic mean, of three terms, arising from the three planes , , and , in contrast to two terms of the earlier from , and planes only. This change corresponds only to the first step of the algorithm, and then steps second to fifth, are applied independently, for the systems, resulting coordinate axes (, , ) from the coordinate planes with , and coordinate axes (, , ) from the coordinate planes with . Copy of the control point coordinates resulting from the two systems, would be output for merged control point coordinates in the system, at the end of the sixth step. By induction, therefore, merging of control points could be computed for a system represented by with coordinate axes (, , …, ), and control points of curves from (1) coordinates planes as (,), (,), …, (,), (,), …, (,) using any common independent coordinate axis, , . The independent coordinates of the second and the third control points of the curve pieces, in that case, are required to be computed using arithmetic mean of (1) terms, corresponding to the (1) coordinate planes.
3 Present Work
In this Section, we present our algorithm, to fit cubic Bspline curve, to a chain of data points in three, or higher dimensional space, using terminologies discussed in Section 2. At first we present steps to construct cubic bspline curves, to the data points in corresponding coordinate planes. Subsequently, we present steps to compute the control points and the curve in the higher dimensional space, from curves in the corresponding coordinate planes, using the merge rule that we have discussed before.
3.1 Algorithm for fitting curve to data points in a coordinate plane (FC2)
The steps in fitting a cubic bspline curve to data points in a coordinate plane are as follows:

Fit cardinal spline interpolating the data points with default value of 0.5 for constant representing parameter of the curve.

Use coordinates and tangents at the data points, to fit tangent continuous cubic bezier curve pieces to every pair of consecutive data points.

Use coordinates of control points of the piecewise cubic bezier curve, to fit a curvature continuous cubic bspline curve.
3.2 Algorithm for fitting curve to data points in the three dimensional space (FC3)
The steps in fitting a cubic bspline curve to data points in the three dimensional space is as follows:

Select data points representing corresponding coordinate planes to compute cubic bspline curves in respective planes using steps specified in FC2 algorithm.

Collect coordinates of control points of piecewise cubic bezier curves on respective coordinate planes.

Merge coordinates of control points of cubic bezier curves at corresponding coordinate planes, to compute control points for the space curve.

Use coordinates of control points in three dimensional space of the piecewise cubic bezier curve, to fit a curvature continuous cubic bspline curve.
4 Related Work
Park et. al. [4] proposed DOM scheme, to improve accuracy and quality of Bspline curve fitting, for planar curves. The approach minimizes square error, by subset of points, named dominant points, selected on the curve, for parameterization. More points are selected from regions of higher curvature, to increase the information content, related to the shape of the curve. Chord length, and centripetal parameterization is used, for the points, indexed from an array of given points, in the fitting. Approach for fitting smooth Bspline curves/surfaces, to unordered/unstructured cloud of points, was proposed by Ma et. al. [2]. Parameterization was considered with reference to point coordinates projected onto a base curve/surface, from the input space. Ravari et. al. [5] minimized cost, of the least squares fit, based on a measure of fitness for the sample, corresponding to information reduced of salient points.
Sung et. al. [3] presented algorithms to enhance performance of optimization of sum of squared distances, for nonlinear problem of geometric fitting of implicit surfaces and planar curves, using GaussNewton method. Form, position, and rotationbased parameters are considered, in Lagrange multipliers, with coordinatebased and distancebased error measures.
Yang et. al. [14] proposed approach for fitting, an active Bspline curve/contour, to a target. The approach does not require parameterization, and inserts/deletes control points, and knots, to converge to the target curve. The approach improves speed of convergence, of square distance minimization (SDM) technique of Pottmann et. al. [15]. Fast marching method [16], is used on distance field computed among curves, from localized footpoint.
Juttler et. al. [17] proposed approaches for implicit description of curves and surfaces, based on solution of simple constraints, and linear equations. The approach uses shape constraints, in contrast to explicit parameterization for surfaces at first. The approach emphasized computation based on sign generating real function, and considerations for simple algorithms using intersection with straight lines. Regions favoring simple computation are grown incrementally, based on processing of scanlines.
Pateloup et. al. [18] used Bspline curves, for interpolation of continuous tool paths required in pocket machining. Numerical controlled paths are produced based on single curves, for milling operation with required accuracy, and in minimum machining time.
5 Experimental Results
In this Section, we present results of experimentation using our algorithm for fitting cubic bspline curve to data points in the three dimensional space. We also present results of experimentation using our algorithm for selection and partitioning of dominant points, for approximating the fitting of cubic bspline curves to given data points in coordinate planes, based on minimization of square error. We implemented our algorithms in matlab, and have run our programs on Octave 4.0.2 installed on standard Windows 7 laptop PC. Certain data sets for our experimentation on approximating bspline curve using dominant points, were followed from related work of Park et. al. [4], and Ma et. al. [2].
Results of fitting bspline curves to data points on coordinate plane are shown in Figures 2 to 5. Each of the Figures contains Sub Figures a. to f. The Sub Figure a. in the Figures, show interpolation of the data points using a shape preserving, and visually pleasing, manner using cubic cardinal spline curve that preserves (or, tangent) continuity at junctions among consecutive segments, corresponding to the first step in FC2 algorithm. Piecewise cubic bezier curve, computed using control points for each piece, with end points and tangents, respective to the segments of cardinal spline, is shown in Sub Figure b, corresponding to the second step in FC2. Curvature continuous bspline curve, using control points corresponding to the piecewise bezier curve in Sub Figure b., and based on the third step in FC2, is shown in Sub Figure c. Based on our algorithm presented in Section 2, approximating bspline constructed using dominant points represented by fraction of the given points, in decreasing order of the fractions, and with corresponding least square errors, are shown in Sub Figures d., e., and f. The observations showed that, the least square error increase in exponents, with increased rate in lowering of the dominant points. Based on our experiments, 70% of the points were observed to be dominant, for shapes given with dense data points, as in Figures 4, and 5.
We have experimented the present approach, on fitting bspline curve, to data point coordinates in the three dimensional space, on multiple data sets prepared by us. Results of experiment, on an example data, is shown in Figure 6. Sub Figure 6.a, shows the data points in the space, reduced to the data points in the corresponding coordinate planes YX and YZ. Curve fitting using FC2 are applied to the data points separately in each of the two coordinate planes. Interpolation using cardinal splines, computation of control points in corresponding planes, and piecewise cubic beziers fitted to the data points, are shown in Figure 6.b, 6.c, 6.d, respectively. Merging of control points in the two coordinate planes, are considered corresponding to control points of the respective pieces of the bezier curves selected from Sub Figure 6.c, using the first two steps of FC3 algorithm. The control points on the coordinate planes after merging of coordinates, based on the next step, are shown in Sub Figure 6.e. Based on this step in FC3, the control points with the merged coordinates are used to produce the points in the higher dimensional space. Finally, the control points thus obtained are then used to compute the cubic bspline curve approximating the data points in the three dimensional space, in the last step of FC3. The projection of the space curve, on the corresponding coordinate planes, is shown in Sub Figure 6.f.
6 Conclusions
We have presented an approach for fitting Bspline curves to data points in three dimensional space. The present solution can approximate data points with cubic bspline curves within a given bound of error in the least square sense. The data point that is next to a present is required to be explicit at input. This fact of the input is used for a shape preserving and visually pleasing interpolation, free from wiggles, as a prerequisite in the present scheme. Fitting to unordered data, based on assumptions on parameters implicitly, with any knowledge on its natural evolution, is not possible in our approach at present, and is a shortcoming. The solution presented though basic, can be both refined for increased continuity or quality of fit, and extended to higher dimensions, based on modifications to knot vectors and merging of control points from dependent lower dimension spaces, respectively. Our work on dominant points is inline with present work on bsplines to fit higher dimensional data. The approach presented for curves, automatically extends to representations for surfaces that may be of biparametric and ruled.
References
 [1] C.F.Borges, T.A. Pastva, Total Least Squares Fitting of Bezier and BSpline Curves to Ordered Data, ComputerAided Geometric Design 19 (9) (2002) 275–289.
 [2] Weiyin Ma, and J.P.Kruth, Parameterization of randomly measured points of least squares fitting of Bspline curves and surfaces, ComputerAided Design 27 (9) (1995) 663–675.
 [3] Sung Joon Ahn, Geometric Fitting of Parametric Curves and Surfaces, Journal of information Processing Systems 4 (4) (2008) 153–158.
 [4] Hyungjun Park, JooHaeng Lee, BSpline curve fitting based on adaptive curve refinement using dominant points, ComputerAided Design 39 (2007) 439–451.
 [5] Alireza Norouzzadeh Ravari, Hamid D. Taghirad, Reconstruction of Bspline curves and surfaces by adaptive group testing, ComputerAided Design 74 (2016) 32–44.
 [6] Thomas A. Foley, and Gregory M. Nielson, Knot Selection for Parametric Spline Interpolation, Mathematical Methods in Computer Aided Geometric Design (1989) 261–271.
 [7] T.N.T Goodman, and K. Unsworth, Shape preserving interpolation by curvature continuous parametric curves, Computer Aided Geometric Design (1988) 323–340.
 [8] F.N. Fritsch, and R.E. Carlson, Monotone Piecewise Cubic Interpolation, Siam Journal of Numer. Anal. 17 (2).
 [9] Samuel P. Martin, Philip W. Smith, Parametric approximation of data using ODR splines, Computer Aided Geometric Design 11 (1994) 247–267.
 [10] J. Hoscheck, Intrinsic parameterization for approximation, Computer Aided Geometric Design 5 (1988) 27–31.
 [11] Edwin Catmull, and Raphael Rom, A Class of Local Interpolating Splines, Computer Aided Geometric Design (1974) 317–326.
 [12] G. Farin, Curves and Surfaces for Computed Aided Geometric Design  A Practical Guide, Academic Press, 1990.
 [13] L. Piegl, W. Tiller, The NURBS book, New York: SpringerVerlag, 1995.
 [14] Huaiping Yang, Wenping Wang, Jiaguang Sun, Control point adjustment for Bspline curve approximation, ComputerAided Design 36 (2004) 639–652.
 [15] H. Pottmann, S. Leopoldseder, H.K. Zhao, The tree: A hierarchical representation of the squared distance function, Technical Report 101, Institute of Geometry, Vienna University of Technology.
 [16] J.A. Sethian, Level set methods and fast marching methods, Cambridge University Press, Cambridge, UK, 1999.
 [17] Bert Juttler, and Alf Felis, Leastsquares fitting of algebraic spline surfaces, Advances in Computational Mathematics 17 (2002) 135–152.
 [18] Vincent Pateloup, Emmanuel Duc, Pascal Ray, Bspline approximation for circle arc and straight line for pocket machining, ComputerAided Design 42 (2010) 817–827.
Comments
There are no comments yet.