Abstract
The existence of Macbeath regions is a classical theorem in convex geometry (Macbeath in Ann Math 56:269–293, 1952), with recent applications in discrete and computational geometry. In this paper, we initiate the study of Macbeath regions in a combinatorial setting and establish near-optimal bounds for several basic geometric set systems.
Original language | English (US) |
---|---|
Pages (from-to) | 625-640 |
Number of pages | 16 |
Journal | Discrete and Computational Geometry |
Volume | 57 |
Issue number | 3 |
DOIs | |
State | Published - Apr 1 2017 |
Keywords
- Epsilon-nets
- Geometric set systems
- Hitting sets
- Macbeath regions
ASJC Scopus subject areas
- Theoretical Computer Science
- Geometry and Topology
- Discrete Mathematics and Combinatorics
- Computational Theory and Mathematics