Positive data modeling using spline function

https://doi.org/10.1016/j.amc.2010.03.034Get rights and content

Abstract

A rational cubic function with two parameters has been constructed to visualize the positive data. The main focus of the work is the representation of the data in such a way that its view looks smooth and attractive. In the first step simple data dependent constraints are derived on the parameters in the description of the rational cubic function to visualize the shape of positive data then, it is extended to a rational bi-cubic partially blended functions (Coons-patches) and derived constraints on parameters to visualize the shape of positive surface data. The developed scheme is locally positive and economical. The approximation order of rational cubic spline function is Ohi3.

Introduction

One of the significant features of interpolatory methods that make sense to study is its positivity. The goal of the paper is to preserve the inherited feature called, positivity of data. More specifically, it has useful discussion on the problem of visualizing data where underlying constrained must be established. To clarify the idea e.g. for a data which is naturally positive, it shows how the spline which interpolates the data can be constrained to preserve the positivity. Paper presents a new model of spline curve and surface. A rational cubic spline with quadratic denominator has been constructed. Here it is important to mention that spline interpolation is a powerful tool in curve and surface designing. In recent years, the rational spline, particularly the rational cubic spline and its application to shape control, design and preservation has received attention in literature [1], [2], [3], [4], [5], [6], [7], [8], [9], [10], [11], [12], [13], [14], [16], [17].

Shape control [22], shape design [21] and shape preservation [16], [17], [18], [19] are important areas for graphical presentation of data. The problem of shape preservation has been discussed by a number of authors. Brodlie and Butt [3] preserved the shape of convex data by piecewise cubic interpolation. In any interval where convexity was lost, the authors divided the interval into two subintervals by inserting extra knot in that interval. The presented method was C1. The authors used the same technique in [4] to preserve the shape of positive data. Fuhr and Kallay [7] used a C1 monotone rational B-spline of degree one to preserve the shape of monotone data. Goodman, Ong and Unsworth [8] presented two interpolating schemes to preserve the shape of data lying on one side of the straight line using rational cubic function. The first scheme preserved the shape of data lying above the straight line by scaling the weights by some scale factor. The second scheme preserves the shape of data by the insertion of a new interpolation point. Goodman [10] surveyed the shape preserving interpolating algorithms for 2D data. Gregory and Sarfraz [11] introduced a rational cubic spline with one tension parameter in each subinterval, both interpolatory and rational B-spline forms. The authors also analyzed the effect of variation of tension parameter on the shape of the curve. Hussain and Sarfraz [13] used rational cubic function in its most generalized form to preserve the shape of positive planar data. The authors used same rational cubic function in [14] to preserve the shape of monotone data. In [13], [14], the authors developed data dependent sufficient conditions on free parameters to preserve the shape of planar data. Lamberti and Manni [16] used cubic Hermite in parametric form to preserve the shape of data. The step length was used as tension parameters to preserve the shape of planar functional data. The first order derivatives at the knots were estimated by a tridiagonal system of equations which assured C2 continuity at the knots. Schmidt and Heβ [20] developed sufficient conditions on derivatives at the end points of interval to assure positivity of cubic polynomial over the whole interval.

The theory, in this paper, has a number of advantageous features. It produces C1 interpolant. No additional points are inserted. Generic interpolatory schemes, although smoother but violates natural characteristics of data. For example, for data in Table 1, the corresponding Fig. 1 may not be wanted by user for the positive data, the user would be ambitious to view it as in Fig. 2. Thus undesirable wiggles which completely deviate the data from its natural features are required to be eliminated. This paper scrutinizes the problem of positive data. Various authors have worked in area of shape preservation. In past few years; several researchers have started using curves and surface of high degree as geometric models or shape descriptors in different model-based-computer vision tasks. Typically speaking, in everyday life many physical situations exist where entities only have sense if their values are positive e.g. in probability distribution, area in the observation of gas discharge etc. It has special usage in image processing, high performance computing, meteorological monitoring, maps, data plots, drawing and many other areas.

The paper has been arranged in a manner so that Section 2 describes the construction of the spline. Section 3 discusses the error of approximation. Constraints for positive curve model have been described in Section 4. The bi-cubic partially blended surfaces have been suggested in Section 5 which is followed by Section 6 devoted to the constraints on the parameters for positive surfaces. The last Section 7 concludes the paper.

Section snippets

Rational cubic function

Let {(xi,fi),i=0,1,2,,n} be the given set of data points defined over the interval [a, b], where a=x0<x1<x2<<xn=b. The piecewise rational cubic function with two free parameters is defined over each subinterval Ii=[xi,xi+1,i=0,1,2,,n-1 asSi(x)=A0(1-θ)3+A1(1-θ)2θ+A2(1-θ)θ2+A3θ3ui(1-θ)2+2(1-θ)θ+viθ2,where θ=x-xihi,hi=xi+1-xi. The piecewise rational cubic function (1) will be C1 if it satisfies the following interpolatory conditions:Si(xi)=fi,Si(xi+1)=fi+1,Si(1)(xi)=di,Si(1)(xi+1)=di+1,Si(1)(x)

Error estimation of interpolation

In this Section the error of interpolation is estimated when the function being interpolated is f(x)C3[x0,xn], using the rational cubic function (1). Keeping in view the locality of interpolation scheme developed in Section 2, the error is investigated in an arbitrary subinterval Ii=[xi,xi+1]. The Peano Kernel Theorem [15] is used to estimate the error adopting the approach of [5]. The error in each subinterval Ii=[xi,xi+1] is defined as:R[f]=f(x)-Si(x)=12xixi+1f(3)(τ)Rx(x-τ)+2dτ.The absolute

Positive curve data model

The problem of positive curve data interpolation is stated as follows: For given set data points {(xi,fi),i=0,1,2,,n} satisfying the conditionfi>0,i=0,1,2,,n.

The piecewise rational cubic function defined in (3) model the positive data as positive curve if in each subinterval Ii=[xi,xi+1] the following relation is trueSi(x)>0,i=0,1,2,,n-1.

The basic idea is to impose conditions on free parameters to assure positivity. It can be observed that ui>0,vi>0 guarantee strictly positive denominator qi(

Bi-cubic partially blended rational function

The rational cubic function (3) is extended to the rational bi-cubic function defined over a 3D data set (xi,yj,Fi,j) with the rectangular mesh D=[x0,xm]×[y0,yn]. Let π:a=x0<x1<x2<<xm=b be the partition of [a, b] and πˆ:c=y0<y1<<yn be the partition of [c, d]. Rational bi-cubic partially blended function is defined over each rectangular patch Ii,j=[xi,xi+1]×[yj,yj+1], as follows:S(x,y)=-AFBT,whereF=0S(x,yj)S(x,yj+1)S(xi,y)S(xi,yj)S(xi,yj+1)S(xi+1,y)S(xi+1,yj)S(xi+1,yj+1),A=-1a0(θ)a1(θ),B=-1b0(ϕ)b

Positive surface data model

Let (xi,yj,Fi,j) be positive data defined over rectangular grid I=[xi,xi+1]×[yj,yj+1],i=0,1,2,3,,m-1;j=0,1,2,3,,n-1 such that Fi,j>0i,j. The bi-cubic partially blended surface patches (20) inherit all the properties of network boundary. The bi-cubic partially blended surface (20) is positive if the boundary curves S(x,yj),S(x,yj+1),S(xi,y) and S(xi+1,y) defined in (21), (22), (23), (24) are positive.S(x,yj)>0ifi=03(1-θ)3-iθiAi>0andq1(θ)>0.q1(θ)>0ifui,j>0andvi,j>0.i=03(1-θ)3-iθiAi>0ifAi>0,i=

Conclusion

A C1 piecewise rational cubic interpolant, with two parameters, has been developed for the modeling of positive data arising from some scientific phenomenon. Data dependent shape constraints are derived on these parameters that guarantee to preserve the shape of the data. The choice of arithmetic mean has been utilized for derivative computations. Generally, choice of the derivative parameters is left at the desire of the user as well. Any numerical derivatives, like arithmetic, geometric or

References (22)

  • G. Beliakov

    Monotonicity preserving approximation of multivariate scattered

    BIT Numerical Mathematics

    (2005)
  • S. Butt, Shape preserving curves and surfaces for computer graphics, Ph.D. Thesis, School of Computer Studies, The...
  • K.W. Brodlie et al.

    Preserving convexity using piecewise cubic interpolation

    Computers and Graphics

    (1991)
  • S. Butt et al.

    Preserving positivity using piecewise cubic interpolation

    Computers and Graphics

    (1993)
  • P. Costantini et al.

    Constructing C3 shape-preserving interpolating space curves

    Advances in Computational Mathematics

    (2001)
  • Q. Duan et al.

    Error estimation of a kind of rational spline

    Journal of Computational and Applied Mathematics

    (2007)
  • R.D. Fahr et al.

    Monotone linear rational spline interpolation

    Computer Aided Geometric Design

    (1992)
  • T.N.T. Goodman, B.H. Ong, K. Unsworth, Constrained interpolation using rational cubic splines, in: G. Farin (Ed.),...
  • T.N.T. Goodman et al.

    Automatic interpolation by fair, shape-preserving G2 space curves

    Computer Aided Design

    (1998)
  • T.N.T. Goodman

    Shape preserving interpolation by curves

  • J.A. Gregory et al.

    A rational cubic spline with tension

    Computer Aided Geometric Design

    (1990)
  • Cited by (0)

    View full text