International audienceThe existence of Macbeath regions is a classical theorem in convex geometry ("A Theorem on non-homogeneous lattices'', Annals of Math, 1952). We refer the reader to the survey of I. Barany for several applications~\cite{B07}. Recently there have been some striking applications of Macbeath regions in discrete and computational geometry. In this paper, we study Macbeath's problem in a more general setting, and not only for the Lebesgue measure as is the case in the classical theorem. We prove near-optimal generalizations for several basic geometric set systems. The problems and techniques used are closely linked to the study of epsilon-nets for geometric set systems
We adapt to an infinite dimensional ambient space E.R. Reifenberg's epiperimetric inequality and a q...
The present thesis is a commencement of a generalization of covering results in specific settings, s...
We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the...
The existence of Macbeath regions is a classical theorem in convex geometry ("A Theorem on non-homog...
The existence of Macbeath regions is a classical theorem in convex geometry (“A Theorem on non-homog...
International audienceThe existence of Macbeath regions is a classical theorem in convex geometry [1...
The analysis of approximation techniques is a key topic in computational geometry, both for practica...
We study the connections between three seemingly different combinatorial structures - uniform bracke...
The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if eve...
International audienceThe packing lemma of Haussler states that given a set system $(X, R)$ with bou...
Convex bodies are ubiquitous in computational geometry and optimization theory. The high combinatori...
AbstractIn this article, we generalize a localization theorem of Lovász and Simonovits [Random walks...
We present algorithmic applications of an approximate version of Caratheodory's theorem. The theorem...
Following groundbreaking work by Haussler and Welzl (1987), the use of small ε-nets has become a sta...
Given a set system (X, R) with VC-dimension d, the celebrated result of Haussler and Welzl (1987) sh...
We adapt to an infinite dimensional ambient space E.R. Reifenberg's epiperimetric inequality and a q...
The present thesis is a commencement of a generalization of covering results in specific settings, s...
We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the...
The existence of Macbeath regions is a classical theorem in convex geometry ("A Theorem on non-homog...
The existence of Macbeath regions is a classical theorem in convex geometry (“A Theorem on non-homog...
International audienceThe existence of Macbeath regions is a classical theorem in convex geometry [1...
The analysis of approximation techniques is a key topic in computational geometry, both for practica...
We study the connections between three seemingly different combinatorial structures - uniform bracke...
The packing lemma of Haussler states that given a set system (X,R) with bounded VC dimension, if eve...
International audienceThe packing lemma of Haussler states that given a set system $(X, R)$ with bou...
Convex bodies are ubiquitous in computational geometry and optimization theory. The high combinatori...
AbstractIn this article, we generalize a localization theorem of Lovász and Simonovits [Random walks...
We present algorithmic applications of an approximate version of Caratheodory's theorem. The theorem...
Following groundbreaking work by Haussler and Welzl (1987), the use of small ε-nets has become a sta...
Given a set system (X, R) with VC-dimension d, the celebrated result of Haussler and Welzl (1987) sh...
We adapt to an infinite dimensional ambient space E.R. Reifenberg's epiperimetric inequality and a q...
The present thesis is a commencement of a generalization of covering results in specific settings, s...
We present a natural reverse Minkowski-type inequality for lattices, which gives upper bounds on the...