Abstract
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 complexity as the insertion of a single point in a Voronoi diagram or a Delaunay triangulation.
This research is supported by the Hong Kong’s Research Grants Council (project PolyU 5068/00E).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Boissonnat JD, Cazals F (2002) Smooth surface reconstruction via natural neighbour interpolation of distance functions. Computational Geometry, 22:185–203.
Devillers O (2002) On Deletion in Delaunay Triangulations. International Journal of Computational Geometry and Applications, 12(3):193–205.
Devillers O, Pion S, Teillaud M (2002) Walking in a triangulation. International Journal of Foundations of Computer Science, 13(2):181–199.
Edelsbrunner H, Shah N (1996) Incremental Topological Flipping Works for Regular Triangulations. Algorithmica, 15:223–241.
Fortune S (1987) A Sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153–174.
Gold CM (1989) Surface Interpolation, spatial adjacency and GIS. In J Raper, editor, Three Dimensional Applications in Geographic Information Systems, pages 21–35. Taylor & Francis.
Guibas LJ, Stolfi J (1985) Primitives for the Manipulation of General Subdivisions and the Computation of Voronoi Diagrams. ACM Transactions on Graphics, 4:74–123.
Lawson CL (1986) Properties of n-dimensional triangulations. Computer Aided Geometric Design, 3:231–246.
Mason NC, O’Conaill MA, Bell SBM (1994) Handling four-dimensional georeferenced data in environmental GIS. International Journal of Geographic Information Systems, 8(2):191–215.
Mostafavi MA, Gold CM, Dakowicz M (2003) Delete and insert operations in Voronoi/Delaunay methods and applications. Computers & Geosciences, 29(4):523–530.
Okabe A, Boots B, Sugihara K, Chiu SN (1992) Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley and Sons.
Owen SJ (1992) An Implementation of Natural Neighbor Interpolation in Three Dimensions. Master’s thesis, Brigham Young University, Provo, UT, USA.
Raper J, editor (1989) Three Dimensional Applications in Geographic Information Systems. Taylor & Francis, London.
Raper J (2000) Multidimensional Geographic Information Science. Taylor & Francis.
Sambridge M, Braun J, McQueen H (1995) Geophysical parameterization and interpolation of irregular data using natural neighbours. Geophysical Journal International, 122:837–857.
Shewchuk JR (2000) Sweep algorithms for constructing higher-dimensional constrained Delaunay triangulations. In Proc. 16th Annual Symp. Computational Geometry, pages 350–359. ACM Press, Hong Kong.
Sibson R (1980) A vector identity for the Dirichlet tesselation. In Mathematical Proceedings of the Cambridge Philosophical Society, 87, pages 151–155.
Sibson R (1981) A brief description of natural neighbour interpolation. In V Barnett, editor, Interpreting Multivariate Data, pages 21–36. Wiley, New York, USA.
Watson DF (1981) Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. The Computer Journal, 24(2):167–172.
Watson DF (1992) Contouring: A Guide to the Analysis and Display of Spatial Data. Pergamon Press, Oxford, UK.
Watson DF (2001) Compound Signed Decomposition, The Core of Natural Neighbor Interpolation in n-Dimensional Space. http://www.iamg.org/naturalneighbour.html.
Watson DF, Phillip G (1987) Neighborhood-Based Interpolation. Geobyte, 2(2):12–16.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ledoux, H., Gold, C. (2005). An Efficient Natural Neighbour Interpolation Algorithm for Geoscientific Modelling. In: Developments in Spatial Data Handling. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-26772-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-26772-7_8
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22610-9
Online ISBN: 978-3-540-26772-0
eBook Packages: Earth and Environmental ScienceEarth and Environmental Science (R0)