Lower bound on the Voronoi diagram of lines in ℝᵈ - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

Lower bound on the Voronoi diagram of lines in ℝᵈ

(1)
1
Marc Glisse

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

Dates and versions

hal-03491732 , version 1 (17-12-2021)

Identifiers

Cite

Marc Glisse. Lower bound on the Voronoi diagram of lines in ℝᵈ. 2021. ⟨hal-03491732⟩
34 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More