Sharp estimates on random hyperplane tessellations

Sjoerd Dirksen, Shahar Mendelson, Alexander Stollenwerk

We study the problem of generating a hyperplane tessellation of an arbitrary set $T$ in ${\mathbb{R}}^n$, ensuring that the Euclidean distance between any two points corresponds to t…