A lower bound on Voronoi diagram complexity.
type: Item
instance of: scholarly article
title: A lower bound on Voronoi diagram complexity.
zbMATH Open document ID: 1044.68855
DOI: 10.1016/S0020-0190(01)00336-2
author: Boris Aronov
published in: Information Processing Letters
publication date: 2003-01-21T00:00:00Z
Mathematics Subject Classification ID: 68U05
zbMATH DE Number: 1856407
zbMATH Keywords: Voronoi diagram
zbMATH Keywords: Computational geometry
zbMATH Keywords: Computational complexity
describes a project that uses: Voronoi
MaRDI profile type: Publication
cites work: Q4945505
cites work: Voronoi diagrams in higher dimensions under certain polyhedral distance functions
cites work: Voronoi Diagrams of Lines in 3-Space Under Polyhedral Convex Distance Functions
cites work: Q3772828
cites work: Voronoi diagrams and arrangements
cites work: Q4401010
cites work: Q3479543
cites work: Almost tight upper bounds for lower envelopes in higher dimensions
cites work: Arrangements in higher dimensions: Voronoi diagrams, motion planning, and other applications
cites work: Q4325546
cites work: A new technique for analyzing substructures in arrangements of piecewise linear surfaces
full work available at URL: s0020-0190(01)00336-2
OpenAlex ID: W1982041519
description: scientific article; zbMATH DE number 1856407