Publication detail
A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm
ŠVEC, P.
English title
A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm
Type
Paper in proceedings (conference paper)
Language
en
Original abstract
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.
Keywords in English
Voronoi diagram, Fortune’s plane sweep algorithm
Released
2006-05-01
Location
Brno
ISBN
80-214-3195-4
Book
Proceedings of the 12th International Conference on Soft Computing MENDEL 2006
Volume
2006
Pages from–to
135–
Pages count
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"
}