Lower bound on the Voronoi diagram of lines in $\mathbb{R}^d$

Marc Glisse

This note gives a lower bound of $\Omega(n^{\lceil 2d/3\rceil})$ on the maximal complexity of the Euclidean Voronoi diagram of $n$ non-intersecting lines in $\mathbb{R}^d$ for $d>2$.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment