Detail publikace
A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm
ŠVEC, P.
Anglický název
A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm
Typ
Stať ve sborníku v databázi WoS či Scopus
Jazyk
en
Originální abstrakt
This paper clearly describes one of the possible constructions of the Voronoi diagram for n point generators using Fortune’s plane sweep algorithm computing in O(n log n) worst-time complexity. This paper aims to aid optimal implementation with thorough documentation, providing a guide through the several possibilities of implementation to choose from, and includes some techniques for better practical realization.
Klíčová slova anglicky
Voronoi diagram, Fortune’s plane sweep algorithm
Vydáno
2006-05-01
Místo
Brno
ISBN
80-214-3195-4
Kniha
Proceedings of the 12th International Conference on Soft Computing MENDEL 2006
Ročník
2006
Strany od–do
135–
Počet stran
10
BIBTEX
@inproceedings{BUT24986,
author="Petr {Švec}",
title="A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm",
booktitle="Proceedings of the 12th International Conference on Soft Computing MENDEL 2006",
year="2006",
volume="2006",
pages="10",
address="Brno",
isbn="80-214-3195-4"
}