Skip to main content
SpringerLink
Log in

An almost distribution-independent incremental Delaunay triangulation algorithm

  • original article
  • Published:
The Visual Computer Aims and scope Submit manuscript

Abstract

This paper presents a new incremental insertion algorithm for constructing a Delaunay triangulation. Firstly, the nearest point is found in order to speed up the location of a triangle containing a currently inserted point. A hash table and 1–3 deterministic skip lists, combined with a walking strategy, are used for this task. The obtained algorithm is compared with the most popular Delaunay triangulation algorithms. The algorithm has the following attractive features: it is fast and practically independent of the distribution of input points, it is not memory demanding, and it is numerically stable and easy to implement.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. de Berg M, van Kreveld M, Overmars M, Schwarzkopf O (1997) Computational geometry: algorithms and applications. Springer, Berlin Heidelberg, New York

    Google Scholar 

  2. Dwyer RA (1987) A faster divide-and-conquer algorithm for constructing Delaunay triangulations. Algorithmica 2(2):137–151

    Article  Google Scholar 

  3. Edelsbrunner H, Seidel R (1986) Voronoi diagrams and arrangements. Discrete Comput Geom 1(1):25–44

    Google Scholar 

  4. Fang T-P, Piegl L (1992) Algorithm for Delaunay triangulation and convex–hull computation using a sparse matrix. Comput Aided Des 24(8):425–436

    Article  Google Scholar 

  5. Fang T-P, Piegl L (1993) Delaunay triangulation using a uniform grid. Comput Graph Appl 13(3):36–47

    Article  Google Scholar 

  6. Fortune S (1987) A sweep-line algorithm for Voronoi diagrams. Algorithmica 2:153–174

    Article  Google Scholar 

  7. Guibas L, Stolfi J (1985) Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams. ACM Trans Graph 4:75–123

    Article  Google Scholar 

  8. Guibas L, Knuth D, Sharir M (1992) Randomised incremental construction of Delaunay and Voronoi diagrams. Algorithmica 7:381–413

    Article  Google Scholar 

  9. Huang C-W, Shih T-Y (1998) Improvements on Sloan’s algorithm for constructing Delaunay triangulations. Comput Geosci 24(2):193–196

    Article  Google Scholar 

  10. Kolingerová I, Žalik B (2002) Improvements to randomized incremental Delaunay insertion. Comput Graph J 26(3):477–490

    Article  Google Scholar 

  11. Lawson CL (1977) Software for C1 Surface Interpolation. In: Price JR (ed) Mathematical Software III. Academic, New York, pp 161–194

  12. Lee DT, Schachter BJ (1980) Two algorithms for constructing a Delaunay triangulation. Int J Comput Inf Sci 9(3):219–242

    Article  Google Scholar 

  13. Mücke EP, Saias I, Zhu B (1996) Fast-randomized point location without preprocessing and two- and three-dimensional Delaunay triangulations. In: Computational Geometry ’96. ACM Press, Philadelphia, pp 274–283

  14. Munro JI, Papadakis T, Sedgewick R (1992) Deterministic skip lists. In: Proceedings of the 3rd ACM-SIAM symposium on discrete algorithms, pp 367–375

  15. Pugh W (1990) Skip lists: a probabilistic alternative to balanced trees. Commun ACM 33(6):668–676

    Article  Google Scholar 

  16. Shewchuk JR (1996) Triangle: engineering a 2D quality mesh generator and Delaunay triangulator. In: 1st workshop on applied computational geometry. Association of Computing Machinery, Philadelphia, pp 124–133

  17. Shewchuk JR (2001) http://www-2.cs.cmu.edu/∼quake/triangle.html A two–dimensional quality mesh generator and delaunay triangulator. Accessed 1 February 2003

  18. Sloan SW (1987) A fast algorithm constructing Delaunay triangulations in the plane. Adv Eng Softw Workstat 9(1):34–55

    Article  Google Scholar 

  19. Su P, Drysdale RLS (1995) A comparison of sequential Delaunay triangulation algorithms. In: Proceedings of the 11th annual symposium on computational geometry. ACM Press, New York, pp 61–70

  20. Žalik B, Kolingerová I (2003) An incremental construction algorithm for Delaunay triangulation using the nearest-point paradigm. Int J Geograph Inf Sci 17(2):119–138

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Electrical Engineering and Computer Science, University of Maribor, Smetanova 17, 2000, Maribor, Slovenia

    Mirko Zadravec & Borut Žalik

Authors
  1. Mirko Zadravec
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Borut Žalik
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Borut Žalik.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Zadravec, M., Žalik, B. An almost distribution-independent incremental Delaunay triangulation algorithm. Visual Comput 21, 384–396 (2005). https://doi.org/10.1007/s00371-005-0293-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00371-005-0293-3

Keywords

Search

Navigation