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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abellanas, M., Bose, P., García, J., Hurtado, F., Nicolás, C.M., Ramos, P.: On structural and graph theoretic properties of higher order Delaunay graphs. Internat. J. Comput. Geom. Appl. 19(6), 595–615 (2009)
Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane graphs. In: 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 504–513. ACM, New York (2006)
Bern, M., Eppstein, D., Yao, F.: The expected extremes in a Delaunay triangulation. Internat. J. Comput. Geom. Appl. 1, 79–91 (1991)
Biniaz, A., Dastghaibyfard, G.: Drainage reality in terrains with higher-order Delaunay triangulations. In: van Oosterom, P., Zlatanova, S., Penninga, F., Fendel, E.M. (eds.) Advances in 3D Geoinformation Systems, pp. 199–211. Springer, Heidelberg (2008)
Biniaz, A., Dastghaibyfard, G.: Slope fidelity in terrains with higher-order Delaunay triangulations. In: 16th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision, pp. 17–23 (2008)
Chang, R.C., Lee, R.C.T.: On the average length of Delaunay triangulations. BIT 24, 269–273 (1984)
Cimikowski, R.J.: Properties of some Euclidian proximity graphs. Pattern Recogn. Lett. 13(6), 417–423 (1992)
Devroye, L.: On the expected size of some graphs in computational geometry. Comput. Math. Appl. 15, 53–64 (1988)
Gudmundsson, J., Hammar, M., van Kreveld, M.: Higher order Delaunay triangulations. Comput. Geom. 23, 85–98 (2002)
de Kok, T., van Kreveld, M., Löffler, M.: Generating realistic terrains with higher order Delaunay triangulations. Comput. Geom. 36, 52–65 (2007)
van Kreveld, M., Löffler, M., Silveira, R.I.: Optimization for first order Delaunay triangulations. Comput. Geom. 43(4), 377–394 (2010)
Matula, D.W., Sokal, R.R.: Properties of Gabriel graphs relevant to geographic variation research and clustering of points in the plane. Geogr. Anal. 12(3), 205–222 (1980)
Miles, R.E.: On the homogenous planar Poisson point-process. Math. Biosci. 6, 85–127 (1970)
Mitsche, D., Saumell, M., Silveira, R.I.: On the number of higher order Delaunay triangulations (2010), arXiv:1002.4364
Santos, F., Seidel, R.: A better upper bound on the number of triangulations of a planar point set. J. Combin. Theory Ser. A 102(1), 186–193 (2003)
Sharir, M., Welzl, E.: Random triangulations of planar point sets. In: 22nd Annual Symposium on Computational Geometry, pp. 273–281. ACM, New York (2006)
Silveira, R.I.: Optimization of polyhedral terrains. Ph.D. thesis, Utrecht University (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-642-13073-1_20
Download citation
DOI: https://doi.org/10.1007/978-3-642-13073-1_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13072-4
Online ISBN: 978-3-642-13073-1
eBook Packages: Computer ScienceComputer Science (R0)