Although the properties of natural neighbour interpolation and its usefulness with scattered and irregularly spaced data are well-known, its implementation is still a problem in practice, especially in three and higher dimensions. We present in this paper an algorithm to implement the method in two and three dimensions, but it can be generalized to higher dimensions. Our algorithm, which uses the concept of flipping in a triangulation, has the same time com- plexity as the insertion of a single point in a Voronoi diagram or a Delaunay triangulation.
CITATION STYLE
Ledoux, H., & Gold, C. (2006). An Efficient Natural Neighbour Interpolation Algorithm for Geoscientific Modelling. In Developments in Spatial Data Handling (pp. 97–108). Springer-Verlag. https://doi.org/10.1007/3-540-26772-7_8
Mendeley helps you to discover research relevant for your work.