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 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 @c"iN, for some fixed positive constant @c"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, @W(2.4317^N), 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 @W(2.33^N).

[1]  E. Szemerédi,et al.  Crossing-Free Subgraphs , 1982 .

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

[3]  Raimund Seidel.  Note – On the Number of Triangulations of Planar Point Sets , 1998, Comb..

[4]  Omer Giménez,et al.  The number of planar graphs and properties of random planar graphs , 2005 .

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

[6]  Fabrizio Grandoni,et al.  Resilient dictionaries , 2009, TALG.

[7]  Robin Thomas,et al.  The Four-Colour Theorem , 1997, J. Comb. Theory, Ser. B.

[8]  Konstantinos Panagiotou,et al.  Maximal biconnected subgraphs of random planar graphs , 2009, TALG.

[9]  Raimund Seidel,et al.  New lower bounds for the number of straight-edge triangulations of a planar point set , 2004 .

[10]  Marc Noy,et al.  Counting triangulations of almost-convex polygons , 1997, Ars Comb..

[11]  Valery A. Liskovets,et al.  A Pattern of Asymptotic Vertex Valency Distributions in Planar Maps , 1999, J. Comb. Theory, Ser. B.

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

[13]  Colin McDiarmid,et al.  Random planar graphs , 2005, J. Comb. Theory B.

[14]  Christian Sohler,et al.  Encoding a triangulation as a permutation of its point set , 1997, CCCG.

[15]  Jack Snoeyink,et al.  Number of Crossing-Free Geometric Graphs vs. Triangulations , 2008, Electron. Notes Discret. Math..

[16]  Warren D. Smith.  Studies in computational geometry motivated by mesh generation , 1989 .

[17]  Marc Noy,et al.  A lower bound on the number of triangulations of planar point sets , 2004, Comput. Geom..