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 2015Show all

2 papers · 1 filter

cs.CG2015★ 2 cited

Approximating the Simplicial Depth

Peyman Afshani, Donald R. Sheehy, Yannik Stein

Let $P$ be a set of $n$ points in $d$ -dimensions. The simplicial depth, $σ_{P} (q)$ of a point $q$ is the number of $d$ -simplices with vertices in $P$ that contain $q$ in their convex…

cs.CG2015★ 7 cited

Time-Space Trade-offs for Triangulations and Voronoi Diagrams

Matias Korman, Wolfgang Mulzer, Andre van Renssen +3

Let $S$ be a planar $n$ -point set. A triangulation for $S$ is a maximal plane straight-line graph with vertex set $S$ . The Voronoi diagram for $S$ is the subdivision of the plane i…