Lower bound on the Voronoi diagram of lines in ℝ^d

03/31/2021

∙

by   Marc Glisse, et al.

∙

0

∙

share

This note gives a lower bound of Ω(n^⌈ 2d/3⌉) on the maximal complexity of the Euclidean Voronoi diagram of n non-intersecting lines in ℝ^d for d>2.