• Corpus ID: 125524017

Algorithms for Tverberg's theorem via centerpoint theorems

  title={Algorithms for Tverberg's theorem via centerpoint theorems},
  author={David Rolnick and Pablo Sober{\'o}n},
  journal={arXiv: Computational Geometry},
  • D. Rolnick, P. Soberón
  • Published 4 January 2016
  • Mathematics, Computer Science
  • arXiv: Computational Geometry
We obtain algorithms for computing Tverberg partitions based on centerpoint approximations. This applies to a wide range of convexity spaces, from the classic Euclidean setting to geodetic convexity in graphs. In the Euclidean setting, we present probabilistic algorithms which are weakly polynomial in the number of points and the dimension. For geodetic convexity in graphs, we obtain deterministic algorithms for cactus graphs and show that the general problem of finding the Radon number is NP… 
6 Citations

Figures from this paper

The discrete yet ubiquitous theorems of Carathéodory, Helly, Sperner, Tucker, and Tverberg
We discuss five discrete results: the lemmas of Sperner and Tucker from combinatorial topology and the theorems of Carath\'eodory, Helly, and Tverberg from combinatorial geometry. We explore their
Robust Tverberg and Colourful Carathéodory Results via Random Choice
  • P. Soberón
  • Mathematics
    Combinatorics, Probability and Computing
  • 2017
Borders are given for the smallest integer N = N(t,d,r) such that for any N points in ℝd, there is a partition of them into r parts for which the following condition holds: after removing any t points from the set, the convex hulls of what is left in each part intersect.
The Crossing Tverberg Theorem
A strengthening of Tverberg's theorem is proved that guarantees a partition which, in addition to the above, has the property that the boundaries of full-dimensional convex hulls have pairwise nonempty intersections.
Tverberg’s theorem is 50 years old: A survey
This survey presents an overview of the advances around Tverberg’s theorem, focusing on the last two decades. We discuss the topological, linear-algebraic, and combinatorial aspects of Tverberg’s
Journey to the Center of the Point Set
An improved algorithm that can compute centerpoints with quality arbitrarily close to 1/d2 and runs in randomized time Õ(d7) randomized time is presented, the first refinement of the algorithm by Clarkson et al. in over 20 years.
Improved Approximation Algorithms for Tverberg Partitions
This work provides the first strongly polynomial (in both $n$ and $d$) approximation algorithm for finding a Tverberg point, and provides several new approximation algorithms for this problem, which improve either the running time or quality of approximation.


Quantitative Tverberg Theorems Over Lattices and Other Discrete Sets
A new variation of Tverberg’s theorem is presented, given a discrete set S, and the number of points needed to guarantee the existence of an m-partition of the points such that the intersection of the m convex hulls of the parts contains at least k points of S.
Radon partitions in convexity spaces
It is shown that the case k=2 does imply that every set of O(k^2 log^2 k) points admits a Tverberg partition into k parts, so that the convex hulls of the parts have a common intersection.
Optimal bounds for the colored Tverberg problem
We prove a "Tverberg type" multiple intersection theorem. It strengthens the prime case of the original Tverberg theorem from 1966, as well as the topological Tverberg theorem of Barany et al.
A Generalisation of Tverberg’s Theorem
We will prove the following generalisation of Tverberg’s Theorem: given a set S⊂ℝd of (r+1)(k−1)(d+1)+1 points, there is a partition of S in k sets A1,A2,…,Ak such that for any C⊂S of at most r
Quantitative Tverberg, Helly, & Carathéodory theorems
This paper presents sixteen quantitative versions of the classic Tverberg, Helly, & Caratheodory theorems in combinatorial convexity. Our results include measurable or enumerable information in the
A Colored Version of Tverberg's Theorem
The main result of this paper is that given n red, n white, and n green points in the plane, it is possible to form n vertex-disjoint triangles Delta_{1},...,Delta_{n} in such a way that the
Approximate centerpoints with proofs
Inapproximability results for graph convexity parameters
In this paper some bounds on the Tveberg-type convexity partition numbers of abstract spaces will be presented. The main objective is to show that a conjecture of J. Eckhoff relating the Tverberg
Approximating center points with iterative Radon points
The algorithm has been used in mesh partitioning methods and can be used in the construction of high breakdown estimators for multivariate datasets in statistics and has the potential to improve results in practice for constructing weak ∊-nets.