On the number of higher order Delaunay triangulations

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

[1]  Gholamhossein Dastghaibyfard,et al.  Drainage reality in terrains with higher-order Delaunay triangulations , 2008 .

[2]  Joachim Gudmundsson,et al.  Higher order Delaunay triangulations , 2000, Comput. Geom..

[3]  Richard C. T. Lee,et al.  On the average length of Delaunay triangulations , 1984, BIT.

[4]  Prosenjit Bose,et al.  On Structural and Graph Theoretic Properties of Higher Order Delaunay Graphs , 2009, Int. J. Comput. Geom. Appl..

[5]  Maarten Löffler,et al.  Generating realistic terrains with higher-order Delaunay triangulations , 2005, Comput. Geom..

[6]  L. Devroye.  THE EXPECTED SIZE OF SOME GRAPHS IN COMPUTATIONAL GEOMETRY , 1988 .

[7]  Rodrigo I. Silveira.  Optimization of polyhedral terrains , 2005 .

[8]  Robert J. Cimikowski.  Properties of some Euclidean proximity graphs , 1992, Pattern Recognit. Lett..

[9]  Ferran Hurtado,et al.  On the number of plane graphs , 2006, SODA '06.

[10]  David Eppstein,et al.  The expected extremes in a Delaunay triangulation , 1991, Int. J. Comput. Geom. Appl..

[11]  Micha Sharir,et al.  Counting Triangulations of Planar Point Sets , 2009, Electron. J. Comb..

[12]  J. Dall,et al.  Random geometric graphs. , 2002, Physical review. E, Statistical, nonlinear, and soft matter physics.

[13]  Maarten Löffler,et al.  Optimization for First Order Delaunay Triangulations , 2007, WADS.

[14]  R. E. Miles.  On the homogeneous planar Poisson point process , 1970 .

[15]  Micha Sharir,et al.  Random triangulations of planar point sets , 2006, SCG '06.

[16]  D. Matula,et al.  Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .

[17]  Delaunay Triangulations.  Slope Fidelity in Terrains with Higher-Order , 2008 .

[18]  Raimund Seidel,et al.  A better upper bound on the number of triangulations of a planar point set , 2003, J. Comb. Theory, Ser. A.