Quantitative combinatorial geometry for continuous parameters
From MaRDI portal
Publication:517447
DOI10.1007/s00454-016-9857-4zbMath1369.52012arXiv1603.05523OpenAlexW2299064519MaRDI QIDQ517447
Reuben N. La Haye, David Rolnick, Pablo Soberón, Jesús A. De Loera
Publication date: 23 March 2017
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1603.05523
Related Items
Isometric and affine copies of a set in volumetric Helly results, Quantitative Tverberg theorems over lattices and other discrete sets, Radon numbers grow linearly, Quantitative Steinitz theorem: A polynomial bound, Helly’s theorem: New variations and applications, Quantitative fractional Helly and \((p,q)\)-theorems, Tverberg’s theorem is 50 years old: A survey, Quantitative combinatorial geometry for concave functions, Discrete quantitative Helly-type theorems with boxes, The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg, A Mélange of Diameter Helly-Type Theorems, Continuous quantitative Helly-type results
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Equal coefficients and tolerance in coloured Tverberg partitions
- Optimal bounds for a colorful Tverberg-Vrećica type problem
- Contraction and expansion of convex sets
- Points surrounding the origin
- A generalization of Caratheodory's theorem
- Quantitative Steinitz's theorems with applications to multifingered grasping
- Piercing convex sets and the Hadwiger-Debrunner \((p,q)\)-problem
- Umbrellas and polytopal approximation of the Euclidean ball
- Approximation of general smooth convex bodies
- A quantitative Doignon-Bell-Scarf theorem
- Tverberg's theorem via number fields
- Constructing a polytope to approximate a convex body
- Quantitative \((p, q)\) theorems in combinatorial geometry
- Metric entropy of some classes of sets with differentiable boundaries
- Optimal bounds for the colored Tverberg problem
- Very colorful theorems
- Quantitative Tverberg theorems over lattices and other discrete sets
- Approximation of convex sets by polytopes
- Dropping a vertex or a facet from a convex polytope
- Helly’s theorem: New variations and applications
- Thrifty Approximations of Convex Bodies by Polytopes
- Helly's Theorem with Volumes
- A Problem of Geometry in R n
- A generalization of Radon's theorem II
- A Colored Version of Tverberg's Theorem
- Asymptotic estimates for best and stepwise approximation of convex bodies I
- Colourful Linear Programming and its Relatives
- Eliminating Tverberg Points, I. An Analogue of the Whitney Trick
- Quantitative Helly-Type Theorems
- A Generalization of Radon's Theorem
- Partitions of points into simplices with \(k\)-dimensional intersection. I: The conic Tverberg's theorem
- Proof of a conjecture of Bárány, Katchalski and Pach
