Contraction and expansion of convex sets

6Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

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εSC..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εSC.. © Springer Science+Business Media, LLC 2009.

Author supplied keywords

Cite

CITATION STYLE

APA

Langberg, M., & Schulman, L. J. (2009). Contraction and expansion of convex sets. Discrete and Computational Geometry, 42(4), 594–614. https://doi.org/10.1007/s00454-009-9214-y

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free