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

Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the members of C is at most O(kn), and that this bound cannot be improved. If we only assume that our sets are connected and vertically convex, that is, their intersection with any vertical line is either a segment or the empty set, then the number of tangencies can be superlinear in n, but it cannot exceed O(n log2 n). Our results imply a new upper bound on the number of regular intersection points on the boundary of C.

Added |
02 Sep 2010 |

Updated |
02 Sep 2010 |

Type |
Conference |

Year |
2010 |

Where |
COMPGEOM |

Authors |
János Pach, Andrew Suk, Miroslav Treml |

Comments (0)