Parallel Algorithms to Find the Voronoi Diagram and the Order-k Voronoi Diagram

Authors:
Christian Trefftz;Joseph Szakas
Affiliations:
-;-
Venue:
IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing
Year:
2003

Citing 0
Cited 3

Voronoi-diagram based heuristics for the location of mobile and unreliable service providers

ACST'06 Proceedings of the 2nd IASTED international conference on Advances in computer science and technology
Accelerated Discovery of Discrete M-Clusters/Outliers on the Raster Plane Using Graphical Processing Units

ICCS '09 Proceedings of the 9th International Conference on Computational Science: Part I
Local Voronoi decomposition for multi-agent task allocation

ICRA'09 Proceedings of the 2009 IEEE international conference on Robotics and Automation

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Voronoi diagram is a classical problem in the area of Computational Geometry. Given a plane and a set of n seed points, the objective is to divide the plane into tiles (or subsets of points), such that the set of points in a tile are closer to a particular seed point than to any other seed. This problem has become increasingly important in the area of Geographic Information Systems (GIS) as Voronoi Diagrams are used in GIS for computing zonal statistics. Current or timely data for GIS is aquired via remotely-sensed devices providing data in raster (regular or Gridded) format. This paper will describe parallel algorithms to find the Voronoi Diagram, the Furthest Site Voronoi Diagram and the Order-k Voronoi Diagram. Prototype implementations in Parallaxis are outlined.