Back to Search Start Over

Epsilon-Mnets: Hitting Geometric Set Systems with Subsets

Authors :
Saurabh Ray
Nabil H. Mustafa
Laboratoire d'Informatique Gaspard-Monge (LIGM)
Centre National de la Recherche Scientifique (CNRS)-Fédération de Recherche Bézout-ESIEE Paris-École des Ponts ParisTech (ENPC)-Université Paris-Est Marne-la-Vallée (UPEM)
NYU
ANR-14-CE25-0016,SAGA,Approximation geometrique structurelle pour l'algorithmique(2014)
Source :
Discrete and Computational Geometry, Discrete and Computational Geometry, Springer Verlag, 2017, ⟨10.1007/s00454-016-9845-8⟩
Publication Year :
2017
Publisher :
HAL CCSD, 2017.

Abstract

International audience; The existence of Macbeath regions is a classical theorem in convex geometry [13], with recent applications in discrete and computational geometry. In this paper, we initiate the study of Macbeath regions in a combinatorial setting—and not only for the Lebesgue measure as is the case in the classical theorem—and establish near-optimal bounds for several basic geometric set systems.

Details

Language :
English
ISSN :
01795376 and 14320444
Database :
OpenAIRE
Journal :
Discrete and Computational Geometry, Discrete and Computational Geometry, Springer Verlag, 2017, ⟨10.1007/s00454-016-9845-8⟩
Accession number :
edsair.doi.dedup.....d347224896ec72784657564c575a50bd
Full Text :
https://doi.org/10.1007/s00454-016-9845-8⟩