A note on the Tolerant Tverberg Theorem
From MaRDI portal
Publication:2411832
DOI10.1007/s00454-017-9875-xzbMath1377.52010OpenAlexW2589860332MaRDI QIDQ2411832
Edgardo Roldán-Pensado, Miguel Raggi, Natalia Garcia-Colin
Publication date: 25 October 2017
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-017-9875-x
Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Other problems of combinatorial convexity (52A37) Helly-type theorems and geometric transversal theory (52A35)
Related Items (8)
Tolerance for colorful Tverberg partitions ⋮ On the number of vertices of projective polytopes ⋮ New lower bounds for Tverberg partitions with tolerance in the plane ⋮ Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes ⋮ Robust Tverberg and Colourful Carathéodory Results via Random Choice ⋮ Algorithms for Radon partitions with tolerance ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
Cites Work
- Unnamed Item
- A generalisation of Tverberg's theorem
- Projective equivalences of \(k\)-neighbourly polytopes
- Equal coefficients and tolerance in coloured Tverberg partitions
- Characterizations of cyclic polytopes
- A NOTE ON ORDER‐TYPE HOMOGENEOUS POINT SETS
- Lectures on Polytopes
- Convex Polytopes
- Curves in Rd intersecting every hyperplane at most d + 1 times
- ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
- A Generalization of Radon's Theorem
- On Sets Projectively Equivalent to the Vertices of a Convex Polytope
- 10 points in dimension 4 not projectively equivalent to the vertices of a convex polytope
- Lawrence oriented matroids and a problem of McMullen on projective equivalences of polytopes
This page was built for publication: A note on the Tolerant Tverberg Theorem
