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

CORR

2010

Springer

2010

Springer

We generalize the notions of flippable and simultaneously-flippable edges in a triangulation of a set S of points in the plane, into so called pseudo simultaneously-flippable edges. Such edges are related to the notion of convex decompositions spanned by S. We derive a worst-case tight lower bound on the number of pseudo simultaneouslyflippable edges in any triangulation, and use this bound to obtain upper bounds for the maximal number of several types of plane graphs that can be embedded (with crossing-free straight edges) on a fixed set of N points in the plane. More specifically, denoting by tr(N) < 30N the maximum possible number of triangulations of a set of N points in the plane, we show that every set of N points in the plane can have at most 6.9283N

Related Content

Added |
01 Mar 2011 |

Updated |
01 Mar 2011 |

Type |
Journal |

Year |
2010 |

Where |
CORR |

Authors |
Michael Hoffmann, Micha Sharir, Adam Sheffer, Csaba D. Tóth, Emo Welzl |

Comments (0)