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

Abstract

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$.