Skip to main content

An Efficient Natural Neighbour Interpolation Algorithm for Geoscientific Modelling

  • Conference paper
Developments in Spatial Data Handling

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

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 219.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  • Boissonnat JD, Cazals F (2002) Smooth surface reconstruction via natural neighbour interpolation of distance functions. Computational Geometry, 22:185–203.

    Google Scholar 

  • Devillers O (2002) On Deletion in Delaunay Triangulations. International Journal of Computational Geometry and Applications, 12(3):193–205.

    Google Scholar 

  • Devillers O, Pion S, Teillaud M (2002) Walking in a triangulation. International Journal of Foundations of Computer Science, 13(2):181–199.

    Google Scholar 

  • Edelsbrunner H, Shah N (1996) Incremental Topological Flipping Works for Regular Triangulations. Algorithmica, 15:223–241.

    Google Scholar 

  • Fortune S (1987) A Sweepline algorithm for Voronoi diagrams. Algorithmica, 2:153–174.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • 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.

    Article  Google Scholar 

  • Lawson CL (1986) Properties of n-dimensional triangulations. Computer Aided Geometric Design, 3:231–246.

    Article  Google Scholar 

  • 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.

    Google Scholar 

  • Mostafavi MA, Gold CM, Dakowicz M (2003) Delete and insert operations in Voronoi/Delaunay methods and applications. Computers & Geosciences, 29(4):523–530.

    Article  Google Scholar 

  • Okabe A, Boots B, Sugihara K, Chiu SN (1992) Spatial Tessellations: Concepts and Applications of Voronoi Diagrams. John Wiley and Sons.

    Google Scholar 

  • Owen SJ (1992) An Implementation of Natural Neighbor Interpolation in Three Dimensions. Master’s thesis, Brigham Young University, Provo, UT, USA.

    Google Scholar 

  • Raper J, editor (1989) Three Dimensional Applications in Geographic Information Systems. Taylor & Francis, London.

    Google Scholar 

  • Raper J (2000) Multidimensional Geographic Information Science. Taylor & Francis.

    Google Scholar 

  • Sambridge M, Braun J, McQueen H (1995) Geophysical parameterization and interpolation of irregular data using natural neighbours. Geophysical Journal International, 122:837–857.

    Google Scholar 

  • 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.

    Google Scholar 

  • Sibson R (1980) A vector identity for the Dirichlet tesselation. In Mathematical Proceedings of the Cambridge Philosophical Society, 87, pages 151–155.

    Google Scholar 

  • Sibson R (1981) A brief description of natural neighbour interpolation. In V Barnett, editor, Interpreting Multivariate Data, pages 21–36. Wiley, New York, USA.

    Google Scholar 

  • Watson DF (1981) Computing the n-dimensional Delaunay tessellation with application to Voronoi polytopes. The Computer Journal, 24(2):167–172.

    Article  Google Scholar 

  • Watson DF (1992) Contouring: A Guide to the Analysis and Display of Spatial Data. Pergamon Press, Oxford, UK.

    Google Scholar 

  • Watson DF (2001) Compound Signed Decomposition, The Core of Natural Neighbor Interpolation in n-Dimensional Space. http://www.iamg.org/naturalneighbour.html.

    Google Scholar 

  • Watson DF, Phillip G (1987) Neighborhood-Based Interpolation. Geobyte, 2(2):12–16.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints 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

Publish with us

Policies and ethics