Join Our Newsletter

Free Online Productivity Tools
i2Speak
i2Symbol
i2OCR
iTex2Img
iWeb2Print
iWeb2Shot
i2Type
iPdf2Split
iPdf2Merge
i2Bopomofo
i2Arabic
i2Style
i2Image
i2PDF
iLatex2Rtf
Sci2ools

COMPGEOM

2010

ACM

2010

ACM

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 ﬁxed i, the expected number of vertices of degree i in a random triangulation is at least γiN, for some ﬁxed positive constant γi (assuming that N > i and that at least some ﬁxed 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 ). Categories and Subject Descriptors G.2.1 [Discrete Mathematics]: Combinatorics—Counting Problems G...

Related Content

Added |
10 Jul 2010 |

Updated |
10 Jul 2010 |

Type |
Conference |

Year |
2010 |

Where |
COMPGEOM |

Authors |
Micha Sharir, Adam Sheffer, Emo Welzl |

Comments (0)