Micha Sharir
ABSTRACT
We study the expected number of interior vertices of degree i in a triangulation of a point set S, drawn uniformly at random from the set of all triangulations of S, and derive various bounds and inequalities for these expected values. One of our main results is: For any set S of N points in general position, and for any fixed i, the expected number of vertices of degree i in a random triangulation is at least γiN, for some fixed positive constant γi (assuming that N > i and that at least some fixed fraction of the points are interior).
We also present a new application for these expected values, using upper bounds on the expected number of interior vertices of degree 3 to get a new lower bound, Ω(2.4317N), for the minimal number of triangulations any N-element planar point set in general position must have. This improves the previously best known lower bound of Ω(2.33N).
- M. Ajtai, V. Chvatal, M. M. Newborn, and E. Szemeredi, Crossing-free subgraphs, Annals Discrete Math. 12 (1982), 9--12.Google Scholar
- O. Aichholzer, F. Hurtado, and M. Noy, A lower bound on the number of triangulations of planar point sets, Comput. Geom. Theory Appl. 29(2) (2004), 135--145. Google ScholarDigital Library
- M.O. Denny and C.A. Sohler, Encoding a triangulation as a permutation of its point set, Proc. 9th Canadian Conf. on Computational Geometry (1997), 39--43.Google Scholar
- O. Gimenez and M. Noy, The number of planar graphs and properties of random planar graphs, Proc. International Conf. on Analysis of Algorithms, Discrete Math. & Theoretical Computer Sci. AD (2005), 147--156.Google Scholar
- F. Hurtado, M. Noy, Counting triangulations of almost-convex polygons, Ars Combin. 45 (1997), 169--179.Google Scholar
- V. A. Liskovets, A pattern of asymptotic vertex valency distributions in planar maps, J. Combinat. Theory, Ser. B 75 (1999), 116--133. Google ScholarDigital Library
- P. McCabe and R. Seidel, New lower bounds for the number of straight-edge triangulations of a planar point set, Proc. 20th European Workshop Comput. Geom. (2004).Google Scholar
- C. McDiarmid, A. Steger, and D.J.A. Welsh, Random planar graphs, J. Combinat. Theory, Ser. B 93 (2005), 187--205. Google ScholarDigital Library
- A. Razen, J. Snoeyink, E. Welzl, Number of crossing-free geometric graphs vs. triangulations, Electronic Notes in Discrete Math. 31 (2008), 195--200.Google ScholarCross Ref
- F. Santos and R. Seidel, A better upper bound on the number of triangulations of a planar point set, J. Combinat. Theory, Ser. A 102(1) (2003), 186--193. Google ScholarDigital Library
- R. Seidel, On the number of triangulations of planar point sets, Combinatorica 18(2) (1998), 297--299.Google ScholarCross Ref
- M. Sharir and A. Sheffer, Counting triangulations of planar point sets, 0911.3352v2 (improves {13}).Google Scholar
- M. Sharir and E. Welzl, Random triangulations of planar point sets, Proc. 22nd ACM Symp. on Computational Geometry (2006), 273--281. Google ScholarDigital Library
- W. S. Smith, Studies in Computational Geometry Motivated by Mesh Generation, Ph.D. Thesis, Princeton University, 1989. Google ScholarDigital Library
- R. P. Stanley, Enumerative Combinatorics, vol. 2, Cambridge University Press, Cambridge, 1999.Google Scholar
Index Terms
- On degrees in random triangulations of point sets
Recommendations
Random triangulations of planar point sets
SCG '06: Proceedings of the twenty-second annual symposium on Computational geometryLet S be a finite set of n+3 points in general position in the plane, with 3 extreme points and n interior points. We consider triangulations drawn uniformly at random from the set of all triangulations of S, and investigate the expected number, vi, of ...
On degrees in random triangulations of point sets
We study the expected number of interior vertices of degree i in a triangulation of a planar point set S, drawn uniformly at random from the set of all triangulations of S, and derive various bounds and inequalities for these expected values. One of our ...
Efficient generation of triconnected plane triangulations
A "rooted" plane triangulation is a plane triangulation with one designated vertex on the outer face. A simple algorithm to generate all triconnected rooted plane triangulations with at most n vertices is presented. The algorithm uses O(n) space and ...
Comments