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

翻译：本说明对Euclidean Voronoi 以$\mathbb{R ⁇ d$为单位的非交叉线以美元计算的最大复杂度下调$\Omega(n ⁇ lceil 2d/3\rcel}) 。