Helly-type theorems for approximate covering

Julien Demouth 1 Olivier Devillers 2 Marc Glisse 3 Xavier Goaoc 1
1 VEGAS - Effective Geometric Algorithms for Surfaces and Visibility
INRIA Lorraine, LORIA - Laboratoire Lorrain de Recherche en Informatique et ses Applications
2 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
3 GIPSA-GPIG - GPIG
GIPSA-DIS - Département Images et Signal
Abstract : Let F \cup {U} be a collection of convex sets in R^d 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_e|)$ either a point in U not covered by F or a subset h_e covering U up to a measure e, with |h_e| meeting our combinatorial bounds.
Document type :
Conference papers
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.inria.fr/inria-00331435
Contributor : Xavier Goaoc <>
Submitted on : Thursday, October 16, 2008 - 4:21:03 PM
Last modification on : Saturday, July 28, 2018 - 1:14:49 AM
Long-term archiving on : Tuesday, October 9, 2012 - 1:51:09 PM

File

AppCovering.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00331435, version 1

Citation

Julien Demouth, Olivier Devillers, Marc Glisse, Xavier Goaoc. Helly-type theorems for approximate covering. 24th Annual Symposium on Computational Geometry (SoCG 2008), Jun 2008, Washington, United States. pp.120--128. ⟨inria-00331435⟩

Share

Metrics

Record views

539

Files downloads

179