arXiv
Open Access
2021
Lower bound on the Voronoi diagram of lines in $\mathbb{R}^d$
Marc Glisse
Abstrak
This note gives a lower bound of $Ω(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$.
Topik & Kata Kunci
Penulis (1)
M
Marc Glisse
Akses Cepat
Informasi Jurnal
- Tahun Terbit
- 2021
- Bahasa
- en
- Sumber Database
- arXiv
- Akses
- Open Access ✓