@inproceedings{4fd26fd3bc3042fa8e9c0a1b119aeea8,
title = "Randomized incremental construction of delaunay and voronoi diagrams",
abstract = "In this paper we give a new randomized incremental algorithm for the construction of planar Voronoi diagrams and Delaunay triangulations. The new algorithm is more “online” than earlier similar methods, takes expected time O(n log n) and space O(n), and is eminently practical to implement. The analysis of the algorithm is also interesting in its own right and can serve as a model for many similar questions in both two and three dimensions. Finally we demonstrate how this approach for constructing Voronoi diagrams obviates the need for building a separate point-location structure for nearest-neighbor queries.",
author = "Guibas, {Leonidas J.} and Knuth, {Donald E.} and Micha Sharir",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 1990.; 17th International Colloquium on Automata, Languages and Programming, 1990 ; Conference date: 16-07-1990 Through 20-07-1990",
year = "1990",
doi = "10.1007/bfb0032048",
language = "אנגלית",
isbn = "9783540528265",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "414--431",
editor = "Paterson, {Michael S.}",
booktitle = "Automata, Languages and Programming - l7th International Colloquium, Proceedings",
}