Please use this identifier to cite or link to this item:
doi:10.22028/D291-26121
Title: | On the construction of abstract Voronoi diagrams |
Author(s): | Mehlhorn, Kurt Meiser, Stefan Ó'Dúnlaing, C. |
Language: | English |
Year of Publication: | 1989 |
Free key words: | Voronoi diagrams randomized algorithms |
DDC notations: | 004 Computer science, internet |
Publikation type: | Report |
Abstract: | We show that the abstract Voronoi diagram of n sites in the plane can be constructed in time O(n log n) by a randomized algorithm. This yields an alternative, but simpler, O(n log n) algorithm in many previously considered cases and the first O(n log n) algorithm in some cases, e.g., disjoint convex sites with the Euclidean distance function. Abstract Voronoi diagrams are given by a family of bisecting curves and were recently introduced by Klein [Kl88a]. Our algorithm is based on Clarkson and Shor's randomized incremental construction technique [CS]. |
Link to this record: | urn:nbn:de:bsz:291-scidok-41734 hdl:20.500.11880/26177 http://dx.doi.org/10.22028/D291-26121 |
Series name: | Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes |
Series volume: | 1989/01 |
Date of registration: | 5-Sep-2011 |
Faculty: | MI - Fakultät für Mathematik und Informatik |
Department: | MI - Informatik |
Collections: | SciDok - Der Wissenschaftsserver der Universität des Saarlandes |
Files for this record:
File | Description | Size | Format | |
---|---|---|---|---|
fb14_1989_01.pdf | 3,17 MB | Adobe PDF | View/Open |
Items in SciDok are protected by copyright, with all rights reserved, unless otherwise indicated.