Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Divide-and-Conquer for Voronoi Diagrams Revisited Oswin Aichholzer
 

Summary: Divide-and-Conquer for Voronoi Diagrams Revisited
Oswin Aichholzer
Wolfgang Aigner
Franz Aurenhammer
Thomas Hackl
Bert J¨uttler§
Elisabeth Pilgerstorfer§
Margot Rabl§
Abstract
We propose a simple and practical divide-and-conquer
algorithm for constructing planar Voronoi diagrams.
The novel aspect of the algorithm is its emphasis on
the top-down phase, which makes it applicable to sites
of general shape.
1 Introduction
The divide-and-conquer paradigm gave the first opti-
mal solution for constructing the closest-site Voronoi
diagram in the plane [13]. Though being a classical
example for applying a powerful algorithmic method
in computational geometry, the resulting algorithm

  

Source: Aurenhammer, Franz - Institute for Theoretical Computer Science, Technische Universität Graz
Technische Universität Graz, Institute for Software Technology

 

Collections: Computer Technologies and Information Sciences