Publication detail

A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm

ŠVEC, P.

Original Title

A Construction of the 2D Generalized Voronoi Diagram, Part II: Some Issues of Implementation of Fortune’s Plane Sweep Algorithm

Type

conference paper

Language

English

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

Voronoi diagram, Fortune’s plane sweep algorithm

Authors

ŠVEC, P.

RIV year

2006

Released

1. 5. 2006

Location

Brno

ISBN

80-214-3195-4

Book

Proceedings of the 12th International Conference on Soft Computing MENDEL 2006

Pages from

135

Pages to

144

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"
}