ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS
From MaRDI portal
Publication:5261015
DOI10.1142/S0218195914600073zbMath1336.52006OpenAlexW3105357693MaRDI QIDQ5261015
Publication date: 1 July 2015
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195914600073
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Helly-type theorems and geometric transversal theory (52A35)
Related Items (6)
A note on the Tolerant Tverberg Theorem ⋮ New lower bounds for Tverberg partitions with tolerance in the plane ⋮ Extensions of the colorful Helly theorem for d-collapsible and d-Leray complexes ⋮ Algorithms for Radon partitions with tolerance ⋮ Tverberg’s theorem is 50 years old: A survey ⋮ No-dimensional Tverberg theorems and algorithms
Cites Work
- A generalisation of Tverberg's theorem
- Tolerance in Helly-type theorems
- Approximate centerpoints with proofs
- Tverberg's theorem via number fields
- A Generalization of Radon's Theorem
- On Sets Projectively Equivalent to the Vertices of a Convex Polytope
- APPROXIMATING CENTER POINTS WITH ITERATIVE RADON POINTS
- A Theorem on General Measure
- Approximating Tverberg points in linear time for any fixed dimension
- Lawrence oriented matroids and a problem of McMullen on projective equivalences of polytopes
This page was built for publication: ALGORITHMS FOR TOLERANT TVERBERG PARTITIONS