Professional Documents
Culture Documents
Abstract: - An important problem between specialists is the interpolation of the surfaces determined by classics
or modern techniques. Choosing the proper technique is practically a rigorous study regarding all the
interpolation methods and using that method according to the needs of the project. The determination of the
Digital terrain model, the digital surface model from GNSS, LiDAR or classic measurements, the determination
of the surface of the quasi – geoid surface with the geometric method from GNSS and leveling observations are
one of the projects that use the interpolation techniques. In this paper are shortly presented the main methods
for interpolating the surfaces as: polynomial interpolation, Delaunay triangulation, nearest neighbor, natural
neighbor, Kriging, inverse distance weighting (IDW) and spline functions. The study ends with a comparative
study regarding the characteristics of each method presented.
Key-Words: -interpolation, surface, Delaunay triangulation, Kriging, Inverse distance weighting (IDW)
ISBN: 978-960-474-335-3 45
Recent Advances in Geodesy and Geomatics Engineering
ISBN: 978-960-474-335-3 46
Recent Advances in Geodesy and Geomatics Engineering
On such surfaces form equation generated by the needs to be determined depending on the values of
above forms or algorithms used to generate such the altitudes of nodes by a bilinear interpolation.
networks nothing can be concluded, each Then the shape of the equation used for the
interpolated or generated surface following its interpolation of Hp value is (2):
typical characteristics. H P = (m - dx)(n - dy)H 1 + (m - dx)dyH 2
In the case of interpolation in a regular grid are + dx(n - dy)H 3 + dxdyH 4 (2)
several methods known in the function used. Thus
X − X1 Y − Y1
we have: where dx = P şi dy = P (3)
− bilinear interpolation X 3 − X1 Y2 − Y1
− Bicubic Interpolation
− Interpolation method nearest neighbor. 2.4. Bicubic spline interpolation
Interpolation in irregular networks can be achieved
Bicubic interpolation is used to interpolate the
using the following methods:
regular grid points using a two-dimensional space.
− nearest neighbor method
Unlike surfaces obtained by bilinear interpolation or
− natural neighbor method nearest neighbor interpolated surface the method
− Delaunay triangulation with linear obtain smoother surfaces.
interpolation method For this method it is be consider a cell in the
− the inverse distance weighted method network of 16 nodes and the interpolated point P
− Kriging method (Fig.4):
− radial basis function method
− polyharmonic spline functions method.
2.3. Bilinear interpolation
Bilinear interpolation or interpolation of 1storder is
used for rectangular networks where nodes know its
coordinates, aiming to find the value within the cell
(Fig. 3)
ISBN: 978-960-474-335-3 47
Recent Advances in Geodesy and Geomatics Engineering
2.5. Delaunay triangulation with linear the nearest neighboring points of a set of randomly
interpolation distributed data (5):
Triangulation with linear interpolation method is a
method well known, being one of the first methods d ( x, y ) = x − y = ( x − y )( x − y ) = (∑ ( x − y ) )
i i i
2 1/ 2
(5)
used before the development of the intensive
2.7. Inverse distance weighting (IDW)
computing. It is based on dividing the domain D in
interpolation method
the Rn space into triangles.
The inverse distance weighted method is a
multivariate interpolation method, ie a process of
assigning values to unknown points by using values
of randomly distributed points. The method of
inverse distance weighted interpolation means that
the result is influenced by the nearby points and
ignores unknown distant points [3].
Interpolation result is the weighted average of the
values of the set of random points, the weight of
each random point is reduced as the distance from
the point interpolated random point increase.
The best known method of interpolation using the
inverse distance weighted method is the method of
Shepard, the simplest form of interpolation [3].
The form of an interpolation equation for Shepard
method is represented by the following relation (6):
n
F ( x, y ) = ∑ wi f i
i =1 (6)
where n is the number of random points in the data
set, fi the value function at points interpolated, and
Fig. 5 Delaunay Triangulation wi is the weight attached to each random point.
Classical formula of the calculation of the weight is
Then each triangle defined, thru it corners, creates a given by (7):
plane surface from linear parts [1].
hi − p
In analytic geometry, Delaunay triangulation for a wi = n
set P of points in a plane is a triangulation
characterized by none of the points from P is in the ∑h
j =1
j
−p
ISBN: 978-960-474-335-3 48
Recent Advances in Geodesy and Geomatics Engineering
ISBN: 978-960-474-335-3 49
Recent Advances in Geodesy and Geomatics Engineering
random functions which are referenced functions to smooth surfaces. The blocks have the size and shape
the creation of the variogram model. of a rectangular grid of cells. Since the block
To interpolate a point P which is surrounded by Kriging interpolation method does not estimate the
points P1, P2 and P3 must first determine the weights value of a point, this is not a solution for the
w1, w2 and w3. They are determined by solving the generation of interpolated surfaces containing the
following system of points on which the surface model was generated.
equations: Even if the values that are intended to be
w1 S ( d11 ) + w2 S ( d12 ) + w3 S (d13 ) = S (d 1 p ) interpolated are in a node of a rectangular network,
block Kriging method estimates for that node a
w1 S ( d12 ) + w2 S (d 22 ) + w3 S (d 23 ) = S (d 2 p ) value close to the original [7][8].
w1 S (d13 ) + w2 S (d 23 ) + w3 S (d 33 ) = S (d 3 p ) (11) The Kriging method involves the following
techniques for interpolation approach:
where S (dij) is variogram model measured at a
− ordinary Kriging method
distance equal to the distance between points i and j.
For example, S (d1p) variogram model is measured − simple Kriging method
at a distance equal to the distance between the − universal Kriging method
points P1 and P. Since it is necessary that the sum of 2.9. Natural neighbor interpolation method
weights is equal to the unit will enter the fourth
equation: The method of natural neighbor interpolation is
based on Voronoi mosaic. Voronoi mosaic may be
w1 + w2 + w3 = 1.0 (12) defined as the partition of a level of n points in each
Because now there are four equations and three convex polygon so that contains exactly one point
unknowns, it also introduces another variable to the and each point in a given polygon is closer to the
final set of equations. The unknown is the Lagrange center than to any other point.
multiplier λ and aims to minimize or maximize the Using natural neighbor interpolation method has
function of the variogram model defined in the many beneficial features. It can be used both for
sense of introducing constraints in the model. In this interpolation and for extrapolation and works well
case the unknowns determined will define a in conjunction with a set of random locations in
function that will pass through the original data set different cell types. The method has been used for
points. What the sum of weights of the unknowns is the first time by Sibson (1981). A more detailed
equal to unity, the equation following the description of natural neighbor interpolation method
introduction of the condition λ becomes: using the multi-dimensional space has been
w1 + w2 + w3 + 0 = 1.0 (13) performed by Owen (1992) [5].
This equation is added to the relations (11): The basic equation used in natural neighbor
w1 S (d11 ) + w2 S (d 12 ) + w3 S (d 13 ) + λ = S (d 1 p ) interpolation method is identical to that used in the
interpolation using the inverse distance weighted
w1 S (d12 ) + w2 S (d 22 ) + w3 S (d 23 ) + λ = S (d 2 p ) method.
w1 S (d13 ) + w2 S (d 23 ) + w3 S (d 33 ) + λ = S (d 3 p )
w1 + w2 + w3 + 0 = 1.0 (14) 3 Conclusion
The linear system of equations will be solved to After analyzing the known methods of multivariate
determine the three values of the weights w1, w2 interpolation they can be presented their main
and w3. The value of the interpolation function fp of characteristics, the goal being to choose the best
a point P is calculated by the formula: method of interpolation of the available data set.
F ( x p , y p ) = w1 f 1 + w2 f 2 + w3 f 3 (15) Delaunay triangulation with linear interpolation
Using the method of least squares to solve the method is a proven method of surfaces interpolation
system of equations (16) for determining the based on dividing a space domain into triangles.
unknowns the error is minimized. Each triangle is defined by the three vertices
There are two types of Kriging interpolation method forming a plane surface resulting from the combined
known as Kriging punctual and block Kriging. Both interpolated flat triangles. The method presents a
methods generate an interpolated surface form a fast interpolation algorithm but has the disadvantage
rectangular network. Punctual Kriging method that the interpolation function is limited to the area
estimates the values of points in the rectangular bounded by convex random set of data points. The
lattice. Block Kriging method estimates the average resulting surface is not smoothed and isolines are
block centered rectangular lattice and generates represented by line segments [12]. Division into
ISBN: 978-960-474-335-3 50
Recent Advances in Geodesy and Geomatics Engineering
triangles can be ambiguous given the simple and the method could be implemented in all the
example below by choosing different triangulation applications.
of the same points it can get different shapes (valley The disadvantages are: the calculation method is
or hill) even if Delaunay criteria were met (Fig.7): time consuming when the number of points in the
data set is large. It increases the number of distances
that have to be calculated. It generates so-called
"bull's eyes” around a point in the interpolated field.
For this reason, the resulting function is not
supported for the vast majority of applications
(Fig.8).
Kriging interpolation method, based on a statistical
formulation of the best linear estimation, is the most
used method to solve the problem of interpolation
and approximation of the surfaces. An important
concept derived from this method is the empirical or
experimental evaluation using the variogram.
Variogram is approximated using empirical or
Fig. 7 The ambiguity of Delaunay triangulation [12] theoretical variogram model. In order to generate it
the linear variogram model, Gaussian or exponential
Natural neighbor can be understood intuitively as all model could be used. The interpolation algorithm is
points adjacent to a given point P and forming a based on a statistical linear formulation for the best
mosaic type Voronoi including point P. The area estimation, which means that there is no other better
created using the natural neighbor interpolated interpolation methods in statistical terms but
surface is continuous at any point except the points equations weights are calculated for each node of
that were the basis for interpolation. It presents a the network. If there is a large number of points than
fast interpolation algorithm and the resulting surface the number of equations to be solved will be large.
is smoothed except the points in which it was made. For this reason the method is used to solve problems
It has the disadvantages that the interpolation in small areas. The method produces grooves (pits)
function is limited to the area bounded by convex or circular isolines into the interpolated model.
random set of data points and the resulted surface As a final conclusion the table below (Table 1)
cannot be accepted in many fields such as geology presents the advantages and disadvantage of all
or hydrology. interpolation methods presented in the current
Inverse distance weighted method was among the paper.
first computer implemented method of interpolation,
being easily programmed. Table 1. Interpolation methods [9][10][12][13]
ISBN: 978-960-474-335-3 51
Recent Advances in Geodesy and Geomatics Engineering
ISBN: 978-960-474-335-3 52