A lower bound on Voronoi diagram complexity

The Voronoi diagram is a much-studied subject in geometry. Some evidence that the lower bound is derived from envelope analysis is closer to the truth is presented.

Saved in:
Bibliographic Details
Published inInformation processing letters Vol. 83; no. 4; pp. 183 - 185
Main Author Aronov, Boris
Format Journal Article
LanguageEnglish
Published Amsterdam Elsevier B.V 31.08.2002
Elsevier Science
Elsevier Sequoia S.A
Subjects
Applied sciences
Artificial intelligence
Computational complexity
Computational geometry
Computer science; control theory; systems
Diagrams
Exact sciences and technology
Geometry
Pattern recognition. Digital image processing. Computational geometry
Studies
Voronoi diagram
Computational geometry
Computational complexity
Voronoi diagram
Voronoï diagram
Three dimensional space
Euclidean space
Online AccessGet full text
ISSN0020-0190
1872-6119
DOI10.1016/S0020-0190(01)00336-2

Cover

More Information
Summary:The Voronoi diagram is a much-studied subject in geometry. Some evidence that the lower bound is derived from envelope analysis is closer to the truth is presented.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ISSN:0020-0190
1872-6119
DOI:10.1016/S0020-0190(01)00336-2