On the Number of Higher Order Delaunay Triangulations

  • Dieter Mitsche
  • Maria Saumell
  • Rodrigo I. Silveira
Conference paper

DOI: 10.1007/978-3-642-13073-1_20

Part of the Lecture Notes in Computer Science book series (LNCS, volume 6078)
Cite this paper as:
Mitsche D., Saumell M., Silveira R.I. (2010) On the Number of Higher Order Delaunay Triangulations. In: Calamoneri T., Diaz J. (eds) Algorithms and Complexity. CIAC 2010. Lecture Notes in Computer Science, vol 6078. Springer, Berlin, Heidelberg

Abstract

Higher order Delaunay triangulations are a generalization of the Delaunay triangulation which provides a class of well-shaped triangulations, over which extra criteria can be optimized. A triangulation is order-k Delaunay if the circumcircle of each triangle of the triangulation contains at most k points. In this paper we study lower and upper bounds on the number of higher order Delaunay triangulations, as well as their expected number for randomly distributed points. We show that arbitrarily large point sets can have a single higher order Delaunay triangulation, even for large orders, whereas for first order Delaunay triangulations, the maximum number is 2n − 3. Next we show that uniformly distributed points have an expected number of at least \(2^{\rho_1 n(1+o(1))}\) first order Delaunay triangulations, where ρ1 is an analytically defined constant (ρ1 ≈ 0.525785), and for k > 1, the expected number of order-k Delaunay triangulations (which are not order-i for any i < k) is at least \(2^{\rho_k n(1+o(1))}\), where ρk can be calculated numerically.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Dieter Mitsche
    • 1
  • Maria Saumell
    • 2
  • Rodrigo I. Silveira
    • 2
  1. 1.Centre de Recerca MatemàticaUniversitat Autònoma de Barcelona 
  2. 2.Dept. Matemàtica Aplicada IIUniversitat Politècnica de Catalunya 

Personalised recommendations