Triangulations and a discrete Brunn-Minkowski inequality in the plane
From MaRDI portal
Publication:2197692
DOI10.1007/s00454-019-00131-9zbMath1447.52002arXiv1812.04117OpenAlexW3102286475WikidataQ127314185 ScholiaQ127314185MaRDI QIDQ2197692
Máté Matolcsi, Oriol Serra, Francisco Santos, Károly jun. Böröczky, Imre Z. Ruzsa
Publication date: 1 September 2020
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1812.04117
Inequalities and extremum problems involving convexity in convex geometry (52A40) Convex sets in (2) dimensions (including convex curves) (52A10)
Related Items
Cites Work
- Unnamed Item
- Unnamed Item
- Compressions and isoperimetric inequalities
- Properties of two-dimensional sets with small sumset
- Triangulations. Structures for algorithms and applications
- A note on triangulations of sumsets
- A Brunn-Minkowski inequality for the integer lattice
- A GENERALIZATION OF THE DISCRETE VERSION OF MINKOWSKI'S FUNDAMENTAL THEOREM
- On a Discrete Brunn--Minkowski Type Inequality
- COMPRESSIONS, CONVEX GEOMETRY AND THE FREIMAN–BILU THEOREM
- Sums of finite subsets in \(\mathbb{R}^d\)