Figures
Abstract
The aim of this paper is to develop a local positivity preserving scheme when the data amassed from different sources is positioned at sparse points. The proposed algorithm first triangulates the irregular data using Delauny triangulation method, therewith interpolates each boundary and radial curve of the triangle by C¹ rational trigonometric cubic function. Half of the parameters in the description of the interpolant are constrained to keep up the positive shape of data while the remaining half are set free for users’ requirement. Orthogonality of trigonometric function assures much smoother surface as compared to polynomial functions. The proposed scheme can be of great use in areas of surface reconstruction and deformation, signal processing, CAD/CAM design, solving differential equations, and image restoration.
Citation: Ibraheem F, Hussain MZ, Bhatti AA (2015) C¹ Positive Surface over Positive Scattered Data Sites. PLoS ONE 10(6): e0120658. https://doi.org/10.1371/journal.pone.0120658
Academic Editor: Cheng-Yi Xia, Tianjin University of Technology, CHINA
Received: July 12, 2014; Accepted: February 5, 2015; Published: June 9, 2015
Copyright: © 2015 Ibraheem et al. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited
Data Availability: All relevant data are within the paper.
Funding: The authors have no support or funding to report.
Competing interests: The authors have declared that no competing interests exist.
1. Introduction
Data measured or amassed from many engineering and scientific fields, is often positioned at sparse points. For example, meteorological measurements at different weather stations [1], density measurements on different positions within the human body, heart potential measurements at random points in the diagnosis of various ailments of heart [2], 3D photography, aeronautical engineering and industrial design, structural graph networks [3], graph entropy [4], [5], [6]. A visual model is often required to get a clear understanding of underlying phe- nomena as colossal amount of data is difficult to analyse or communicate a message in raw form. Further, a meticulous visual representation obligates the interpolating function to affirm intrinsic attributes of data like positivity, monotonicity and convexity. Although, tensor product provides a robust medium for fitting surface to rectilinear data sites, it can not be used to fit a surface over sparse data points. This paper addresses the problem of retaining positivity over scattered data points.
Several approaches have been proposed in literature to address the problem of positivity preserving interpolating surfaces. Amidor [7] surveyed method to interpolate scattered data necessitating from electronic imaging system. The author mainly examined radial basis function method, tetrahedral interpolation, cubic triangular interpolation, triangle based blending interpolation, inverse distance method and neutral neighbourhood. The difference between scattered data interpolation and scattered data fitting was also demonstrated in the survey. Cubic and quintic Hermite interpolants were used for preserving monotonicity, positivity and convexity of discrete data by [8]. Piah, Goodman, Unsworth [9] first triangulated the data points by Delaunay triangulation and constructed the interpolating surface consisting of “cubic Bezier triangular patches”. Positivity of data was achieved by imposing sufficient conditions on Bezier ordinates in each triangular patch. The proposed scheme was local and C1 continous. Hussain and Hussain [10] arranged the scattered data over a triangular grid to preserve the positivity and monotonicity. The authors used a cubic interpolant with one parameter to interpolate the boundary of each triangular patch while linear interpolant was used in Nielson side vertex method to obtain radial curves. Final surface patch was obtained by convex combination of interpolants. Positivity and monotonicity was retained by deriving data dependent constraints on free parameters. C1 Quadratic splines and Powell-Sabin splines were used as interpolating function to tackle the problem of range restricted univariate and bivariate scattered data by Hermann et. al. [11]. The authors obtained a system of inequalities for the gradients and positivity was accomplished by deriving sufficient conditions on this system. A C1 local rational cubic Bernstein Bezier interpolatory scheme was proposed by Hussain and Hussain [12] to retain positivity of scattered data. In each triangular patch, inner and boundary Bezier ordinates were confined for positivity. If in any triangular grid, Bezier ordinates failed to attain positive shape of data, then these were varied by the weights described in formation of rational cubic Bernstein Bezier interpolant. Sarfraz et. al. [1] established a local C1 approach to keep up the positivity of scattered data positioned over a triangular domain. They employed C1 rational cubic function with four parameters in Nielson side vertex technique to formulate the interpolating surface. Two of the four parameters were constrained for positivity.
Although several approaches have been proposed to retain the positivity of data, little attention has been paid towards the use of trigonometric basis function. This paper develops a positivity preserving scheme for scatter data by taking C1 rational trigonometric function [13] into account. Delaunay triangulation method has been used to place scatter data as vertices of triangle. Nielson side vertex method [14] has been employed in each triangle to construct triangular patches. The C1 rational trigonometric cubic function [13] with four parameter has been used for the interpolation along boundary and radial curve of the triangle. Positivity is attained by deriving data dependent condition on half of the parameters in the description of C1 rational trigonometric cubic function [13].
The remainder of the paper is formulated as: Section 2 reviews the ratonal trigonometric cubic function [13]. Nielson side vertex method [14] to formulate triangular patches is detailed in Section 3. Positivity preserving algorithm is developed and explained in Section 4. Section 5 demonstrates the developed algorithm and presents graphical results. Section 5 summarizes this research and draws conclusion.
2. Rational Trigonometric Cubic Function
Let {(xi, yi), i = 0,1,2, …, n−1} be the given set of data points defined over the interval [a, b] where a = x0 < x1 < x2 < … < xn = b. A piecewise rational trigonometric cubic function is defined over each subinterval Ii = [xi, xi+1] as
(1)
where
The rational trigonometric cubic function (Eq 1) satisfy the following properties:
(2) di and di+1 are derivative at the endpoints of the interval Ii = [xi, xi+1]. αi, βi, γi and δi are the free parameters. The following result has been proved in [13].
Theorem 2.1 The C1 piecewise rational trigonometric cubic function preserve the positivity of positive data if in each subinterval Ii = [xi,xi+1], the parameters βi and γi satisfy the following sufficient conditions
3. Nielson Side Vertex Method
Consider a triangle △V1 V2 V3 with vertices V1, V2, V3 having edges e1, e2, e3 and u, v, w be the barycentric coordinates such that any point V on the triangle can be written as:
(3)
where
The interpolant defined by Nielson [14] to generate surface over each triangular patch is defined as the following convex combination:
(4)
where
represent line segments joining vertices
to points
on the opposite boundary. Eq (4) interpolates data at the vertices as well as first order derivatives at the boundary. Since the barycentric coordinates at the vertices of triangle is simultaneously zero, the interpolant Eq (4) takes the following values:
where Qi, i = 1,2,3 are the ordinate values at the vertices Vi, i = 1,2,3 of triangle.
4. Positive Scatter Data Interpolation
This section details the derivation of sufficient conditions for C1 triangular patches to be positive. Let the given positive scattered data set arranged over a triangular domain be {(xi, yi, Fi), i = 1,2, …, n}. The resulting surface S(x, y) described as
(5)
is positive if
(6)
4.1 Domain Triangulation
Triangulation of data is performed by Delaunay triangulation method such that data Fi, fall on vertices {Vi = (xi, yi), i = 1,2,3, …, n} of the triangles.
4.2 Estimation of Derivatives
Partial derivatives at the vertices Vi, i = 1,2,3 of each triangle are calculated by derivative estimation scheme suggested by Goodman et. al. [15]
4.3 C1 Positive triangular patch
Let V1 V2 V3 be the given triangle with edges ei, i = 1,2,3 opposite to the vertices Vi, i = 1,2,3 respectively and Si, i = 1,2,3 be the points on the edges opposite to vertices Vi, i = 1,2,3. The radial curve Q1 connecting vertex V1 to the points S1 on the opposite edges e1 is defined as (Fig 1):
(7)
where
such that
R1 and R2 are the directional derivatives at V1 and S1 (Fig 2) defined as
and F(S1) is the boundary curve along the edge e1 evaluated from the following expression
where
such that
d3 and d4 are the directional derivatives along
at V2 and V3 (Fig 3)
From Eq 7, Q1 > 0 if
Now, Q1n > 0 if
(8)
From Theorem 2.1, F(S1) > 0 if
(9)
Now, Q1d > 0 if
Likewise, radial curve Q2 connecting vertex V2 to the points S2 on the opposite edges e2 is defined as
(10)
where
such that
(11)
R3 and R4 are the directional derivatives at V2 and S2
and F(S2) is the boundary curve along the edge e2 to be evaluated from the following expression
where
d5 and d6 are the directional derivatives along
at V1 and V3
From Eq 10, Q2 > 0 if
Now, Q2n > 0 if
(12)
From Theorem 2.1, F(S2) > 0 if
(13)
Now, Q2d > 0 if
and the radial curve Q3 connecting vertex V3 to the point S3 on the opposite edge e3 is defined as
(14)
where
where R5 and R6 are the directional derivatives at V3 and S3 defined as
and F(S3) is the boundary curve along the edge e3 to be evaluated from the following expression
where
d1 and d2 are the directional derivatives along
at V1 and V2
From Eq 14, Q3 > 0 if
Now, Q3n > 0 if
(15)
From Theorem 2.1, F(S3) > 0 if
(16)
Now, Q3d > 0 if
The above discussion leads to the following result:
Theorem 4.1 The C1 triangular pactch P in Eq (4) is positive if the following conditions are attained.
The above constraints can be rearranged as
5. Numerical Examples
This section illustrates the positivity preserving scheme for scattered data devised in Section 4.3.
Example 5.1 Positive scattered data is taken in Table 1. Fig 4 represents corresponding delaunay triangulations. The data is interpolated first by Eq (4) for arbitrary values of free parameters, α1 = 4.1, α2 = 3;α3 = 2.5, α4 = 1.6, α5 = 2.7, α6 = 2.8, β1 = 3.8, β2 = 2.4, β3 = 4.2, β4 = 2.5, β5 = 1.5, β6 = 4, γ1 = 1, γ2 = 6, γ3 = 1, γ4 = 2, γ5 = 2, γ6 = 3, δ1 = 1, δ2 = 3, δ3 = 3, δ4 = 1, δ5 = 2, δ6 = 1. The resulting surface is displayed in Fig 5. It is clear from Fig 5 that the inherent shape feature of positivity of data could no be held in visual model. This detriment is removed in Figs 6, 7 and 8 by implementing positivity preserving conditions summarized in Theorem 4.1. It is worth mentioning here that parameters αi and δi for i = 1,2, …,6 are left free to refine the shape according to user’s requirement. The effect of free parameters are shown in Figs 6, 7 and 8. Figs 6 and 7 are constructed against the parameter choice α1 = 12, α2 = 0.4, α3 = 13, α4 = 0.22, α5 = 12, α6 = 0.33, δ1 = 13, δ2 = 0.3, δ3 = 14, δ4 = 0.3, δ5 = 15, δ6 = 12 and α1 = 0.1, α2 = 1.0, α3 = 0.5, α4 = 1.6, α5 = 0.7, α6 = 0.8, δ1 = 0.8, δ2 = 0.4, δ3 = 1.2, δ4 = 1.5, δ5 = 1.5, δ6 = 1.0 respectively, which lacks smoothness. A smooth visibly pleasant representation is obtained in Fig 8 by setting α1 = 1.0, α2 = 1.0, α3 = 0.5, α4 = 0.6, α5 = 0.7, α6 = 0.8, δ1 = 0.8, δ2 = 0.4, δ3 = 1.2, δ4 = 0.5, δ5 = 1.0, δ6 = 1.0
Example 5.2 A Positive scattered data set is displayed in Table 2. Delauny triangulation is illustrated in Fig 9 and the corresponding surface in Fig 10 is obtained by interpolating the data for arbitrary values of free parameters, α1 = 4.1, α2 = 3;α3 = 2.0, α4 = 1.5, α5 = 2.7, α6 = 2.5, β1 = 3.5, β2 = 2.3, β3 = 3.2, β4 = 2.2, β5 = 1.0, β6 = 4.5, γ1 = 1.4, γ2 = 5.5, γ3 = 1.5, γ4 = 2.2, γ5 = 1.5, γ1 = 2.5, δ1 = 0.5, δ2 = 3.1, δ3 = 3.5, δ4 = 0.4, δ5 = 2, δ6 = 1.2, in description of Eq (4). It is evident from Fig 10 that the positivity of data could not be conserved in visual model. This impediment is removed in Figs 11, 12 and Fig 13 by implementing positivity preserving constraints on parameters βi, γi for i = 1,2, …,6, summarized in Theorem 4.1. Here, it is noteworthy that parameters αi and δi for i = 1,2, …,6 are set free to refine the shape as required by the user. The effect of free parameters are shown in Figs 11, 12 and 13. Figs 11 and 12 are constructed against the parameter choice α1 = 2.0, α2 = 0.1, α3 = 0.5, α4 = 0.5, α5 = 1.0, α6 = 0.63, δ1 = 1.0, δ2 = 0.33, δ3 = 0.5, δ4 = 0.4, δ5 = 1.0, δ6 = 0.3 and α1 = 2.2, α2 = 1.1, α3 = 2.5, α4 = 1.5, α5 = 1.0, α6 = 1.0, δ1 = 1.0, δ2 = 1.0, δ3 = 1.5, δ4 = 1.4, δ5 = 1.0, δ6 = 0.3 respectively, which lacks smoothness. A smooth visibly pleasant representation is obtained in Fig 13 by setting α1 = 2.0, α2 = 0.4, α3 = 0.5, α4 = 0.5, α5 = 1.0, α6 = 0.63, δ1 = 0.3, δ2 = 0.33, δ3 = 0.5, δ4 = 0.3, δ5 = 0.5, δ6 = 0.2.
Conclusion
In this study, positivity preserving algorithm for scattered data arranged over a triangular domain, is established. The rational trigonometric cubic function [13] with four free parameters is used for the interpolation along each boundary and radial curve. Nielson side vertex has been applied to construct the interpolating surface. Constraints on half of the parameters are obtained to guarantee the positive shape of data while half are set free for users modification. The proposed algorithm, surpasses many prevailing approaches in literature. In [10], authors utilized a cubic function with one free parameter to retain the positive shape of data. Positive surface was obtained by drawing data dependent constraints on this free parameter, and, hence the scheme did not offer refinement in the shape. The scheme suggested in this paper does not suffer this detriment. The developed algorithm is local and can be applied to data with or without derivatives. Moreover, shape preserving algorithms play an instrumental role in many areas of visualization such as geometric modelling, robot trajectories, evolution game theory, prisoner’s dilemma game [16], [17], [18], meshless method and inverse kinemaics etc.
Author Contributions
Conceived and designed the experiments: FI MZH AB. Performed the experiments: FI MZH AB. Analyzed the data: FI MZH AB. Contributed reagents/materials/analysis tools: FI MZH AB. Wrote the paper: FI MZH AB.
References
- 1. Sarfraz M, Hussain MZ, Arfan M. Positivty preserving scattered data interpolation scheme using the side vertex method. Applied Mathematics and Computation. 2012;218(15):7898–7910.
- 2. Franke R, Nielson GM. Smooth interpolation of larger sets of scattered data. International Journal of Numerical Methods in Engineering. 1980;15:1691–1704.
- 3. Kraus V, Dehmer M, Emmert-Streib F. Probabilistic inequalities for evaluating structural network measures. Information Sciences. 2014;288:220–245.
- 4. Dehmer M, Emmert-Streib F, Shi Y. Interrelations of graph distance measures based on topological indices. PLoS ONE. 2014; 9.
- 5. Cao S, Dehmer M, Shi Y. Extremality of degree-based graph entropies. Information Sciences. 2014;278:22–33.
- 6. Gupta MK, Niyogi R, Misra M. A 2D Graphical Representation of Protein Sequence and Their Similarity Analysis with Probabilistic Method. MATCH Communications in Mathematical and in Computer Chemistry. 2014;72:519–532.
- 7. Amidor I. Scattered data interpolation methods for electronic imaging systems:survey. Journal of Electronic Imaging. 2002;11(2):157–176.
- 8. Dougherty RL, Edelman Z, Hyman JM. Non-negativity, monotonicity or convexity preserving cubic and quintic Hermite interpolation. Mathematics of Computation. 1989;52(186):471–494.
- 9.
Piah ARM, Goodman TNT, Unsworth K. Positivity preserving scattered data interpolation. In: Martin R, Bez H, Sabin M, editors. Proceeding of Mathematics of Surfaces, Lecture Notes in Computer Science,3604. New York: Springer-Verlag Berlin Heidelberg; 2005. p. 336–349.
- 10. Hussain MZ, Hussain M. Shape preserving scattered data interpolation. European Journal of Scientific Research. 2009;25(1):151–164.
- 11. Hermann M, Mulansky B, Schmidt JW. Scattered data interpolation subject to piecewise quadratic range restriction. Journal of Computational and Applied Mathematics. 1996;73:209–223.
- 12. Hussain MZ, Hussain M. C1 positivity preserving scattered dat interpolation using Bernstein Bezier triangular patch. Journal of Applied Mathematics and Computing. 2011;35:281–293.
- 13. Ibraheem F, Hussain M, Hussain MZ, Bhatti AA. Data visualizaation using Trigonometric function. Journal of Applied Mathematics. 2012;2012:1–19.
- 14. Nielson GM. The side-vertex method for interpolation in triangles. Journal of Approximatio Theory. 1979;25:316–336.
- 15. Goodman TNT, Said HB, Chang LHT. Local derivative estimation for scattered data interpolation. Applied Mathematics and Computation. 1995;68:41–50.
- 16.
Davidson KR. The Evolution of Cooperation. Newyork: Basic Books; 2006.
- 17. Ma ZQ, Xia CY, Sun SW, Wang L, Wang HB, Wang J. Heterogeneous link weight promotes the cooperation in spatial prisoner’s dilemma. International Journal of Modern Physics C. 2011;22:1257–1258.
- 18. Jaun W, Yi XC, Yiling W, Shuai D, JunQing S. Spatial prisoner’s delimma games with increasing size of the interaction neighborhood on regular lattices. Chinese Science Bulletin. 2012;57:724–728.