Algorithms for Tolerant Tverberg Partitions

Wolfgang Mulzer, Yannik Stein

Let $P$ be a $d$-dimensional $n$-point set. A partition $T$ of $P$ is called a Tverberg partition if the convex hulls of all sets in $T$ intersect in at least one point. We say $T$…