Helly-type theorems for approximate covering - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Discrete and Computational Geometry Year : 2009

Helly-type theorems for approximate covering

Abstract

Let F ∪ {U } be a collection of convex sets in Rd such that F covers U . We prove that if the elements of F and U have comparable size then a small subset of F suffices to cover most of the volume of U ; we analyze how small this subset can be depending on the geometry of the elements of F , and show that smooth convex sets and axis parallel squares behave differently. We obtain similar results for surface-to-surface visibility amongst balls in 3 dimensions for a notion of volume related to form factor. For each of these situations, we give an algorithm that takes F and U as input and computes in time O (|F | ∗ |Hϵ |) either a point in U not covered by or a subset ϵ covering U up to a measure ϵ, with ϵ meeting our combinatorial bounds.
Fichier principal
Vignette du fichier
appcover.pdf (245.47 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00404171 , version 1 (15-07-2009)

Identifiers

Cite

Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc. Helly-type theorems for approximate covering. Discrete and Computational Geometry, 2009, 42 (3), pp.379--398. ⟨10.1007/s00454-009-9167-1⟩. ⟨inria-00404171⟩
471 View
220 Download

Altmetric

Share

Gmail Facebook X LinkedIn More