Yannik Stein

activity

20132022

most citedAlgorithms for Tolerant Tverberg Partitions

9 citations · 27 across the 10 of their papers we have counts for

collaborators

Showing 2014Show all

2 papers · 1 filter

cs.CG2014★ 3 cited

Computational Aspects of the Colorful Carathéodory Theorem

Wolfgang Mulzer, Yannik Stein

Let $C_{1}, \dots, C_{d + 1} \subset R^{d}$ be $d + 1$ point sets, each containing the origin in its convex hull. We call these sets color classes, and we call a sequence $p_1, \dots…

cs.CG2014

Approximate k-flat Nearest Neighbor Search

Wolfgang Mulzer, Huy L. Nguyen, Paul Seiferth +1

Let $k$ be a nonnegative integer. In the approximate $k$ -flat nearest neighbor ( $k$ -ANN) problem, we are given a set $P \subset R^{d}$ of $n$ points in $d$ -dimensional space…