SciDok

Eingang zum Volltext in SciDok

Lizenz

Report (Bericht) zugänglich unter
URN: urn:nbn:de:bsz:291-scidok-41768
URL: http://scidok.sulb.uni-saarland.de/volltexte/2011/4176/


On the construction of abstract Voronoi diagrams, II

Klein, Rolf ; Mehlhorn, Kurt ; Meiser, Stefan

Quelle: (1989) Saarbrücken, 1989
pdf-Format:
Dokument 1.pdf (3.503 KB)

Bookmark bei Connotea Bookmark bei del.icio.us
Freie Schlagwörter (Englisch): Voronoi diagrams , randomized algorithms
Institut: Fachrichtung 6.2 - Informatik
DDC-Sachgruppe: Informatik
Dokumentart: Report (Bericht)
Schriftenreihe: Technischer Bericht / A / Fachbereich Informatik, Universität des Saarlandes
Bandnummer: 1989/03
Sprache: Englisch
Erstellungsjahr: 1989
Publikationsdatum: 05.09.2011
Kurzfassung auf Englisch: Abstract Voronoi Diagrams are defined by a system of bisecting curves in the plane, rather than by the concept of distance [K88a,b]. Mehlhorn, Meiser, Ó'Dúnlaing [MMO] showed how to construct such diagrams in time O(n log n) by a randomized algorithm if the bisecting curves are in general position. In this paper we drop the general position assumption. Moreover, we show that the only geometric operation in the algorithm is the construction of a Voronoi diagram for five sites. Using this operation, abstract Voronoi diagrams can be constructed in a purley combinatorial manner. This has the following advantages. On the one hand, the construction of a five-site-diagram is the only operation depending on the particular type of bisecting curves and we can therefore apply the algorithm to all concrete diagrams by simply replacing this operation. On the other hand, this is the only operation computing intersection points; thus, problems arising from instable numerical computations can occur only there.
Lizenz: Standard-Veröffentlichungsvertrag

Home | Impressum | Über SciDok | Policy | Kontakt | Datenschutzerklärung | English