## תקציר

Let be a set system of convex sets in ℝ^{d}. Helly's theorem states that if all sets in have empty intersection, then there is a subset S′ ⊂ S of size d+1 which also has empty intersection. The conclusion fails, of course, if the sets in are not convex or if does not have empty intersection. Nevertheless, in this work we present Helly-type theorems relevant to these cases with the aid of a new pair of operations, affine-invariant contraction, and expansion of convex sets.These operations generalize the simple scaling of centrally symmetric sets. The operations are continuous, i.e., for small ε>0, the contraction C^{-ε} and the expansion C^{ε} are close (in the Hausdorff distance) to C. We obtain two results. The first extends Helly's theorem to the case of set systems with nonempty intersection:(a) If is any family of convex sets in ℝ^{d}, then there is a finite subfamily S′ ⊆ S whose cardinality depends only on ε and d, such that {double intersection}CεS′^{C-ε} ⊆ {double intersection}CεS^{C.}.The second result allows the sets in a limited type of nonconvexity:(b) If is a family of sets in ℝ^{d}, each of which is the union of kfat convex sets, then there is a finite subfamily S′ ⊆ S whose cardinality depends only on ε, d, and k, such that {double intersection}CεS′^{C-ε} ⊆ {double intersection}CεS^{C.}.

שפה מקורית | אנגלית |
---|---|

עמודים (מ-עד) | 594-614 |

מספר עמודים | 21 |

כתב עת | Discrete and Computational Geometry |

כרך | 42 |

מספר גיליון | 4 |

מזהי עצם דיגיטלי (DOIs) | |

סטטוס פרסום | פורסם - אוק׳ 2009 |

### הערה ביבליוגרפית

Funding Information:Research supported in part by grants from the NSF and the NSA.