inria-00179277, version 3
Helly-type theorems for approximate covering
Julien Demouth
1Olivier Devillers
2Marc Glisse
1Xavier Goaoc
1
N° RR-6342 (2007)
Résumé : Let F be a covering of a unit ball U in Rd by unit balls. We prove that for any epsilon >0, the smallest subset of F leaving at most a volume epsilon of U uncovered has size O(epsilon^((1-d)/2)polylog 1/epsilon). We give an example showing that this bound is tight in the worst-case, up to a logarithmic factor, and deduce an algorithm to compute such a small subset of F. We then extend these results in several directions, including covering boxes by boxes and visibility among disjoint unit balls in R3.
- 1 : VEGAS (INRIA Lorraine - LORIA)
- INRIA – CNRS : UMR7503 – Université Henri Poincaré - Nancy I – Université Nancy II – Institut National Polytechnique de Lorraine
- 2 : GEOMETRICA (INRIA Sophia Antipolis / INRIA Futurs)
- INRIA
- Domaine : Informatique/Géométrie algorithmique
- Mots-clés : Helly – covering – visibility
- Référence interne : RR-6342
- Versions disponibles : v1 (15-10-2007) v2 (05-11-2007) v3 (05-11-2007)
- inria-00179277, version 3
- http://hal.inria.fr/inria-00179277
- oai:hal.inria.fr:inria-00179277
- Contributeur : Olivier Devillers
- Soumis le : Lundi 5 Novembre 2007, 13:20:25
- Dernière modification le : Jeudi 16 Octobre 2008, 14:55:33






Documents associés
Exporter