OpenAlex
Algorithms For Tolerant Tverberg Partitions
Work
Year: 2014
Type: article
Abstract: 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$ is $t$-tolerant if ... more
Cites: 15
Cited by: 13
Related to: 10
FWCI: 3.855
Citation percentile (by year/subfield): 94.87
Open Access status: green