Back to Search
Start Over
Epsilon-Mnets: Hitting Geometric Set Systems with Subsets
- 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.
- Subjects :
- Discrete mathematics
Convex geometry
010102 general mathematics
[SCCO.COMP]Cognitive science/Computer science
0102 computer and information sciences
Computational geometry
01 natural sciences
Theoretical Computer Science
Set (abstract data type)
Combinatorics
Computational Theory and Mathematics
010201 computation theory & mathematics
Discrete Mathematics and Combinatorics
Geometry and Topology
0101 mathematics
Classical theorem
Mathematics
Subjects
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⟩