By Topic

Parallel algorithms to find the Voronoi diagram and the order-k Voronoi diagram

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Trefftz, C. ; Dept. of Comput. Sci. & Inf. Syst., Grand Valley State Univ., Allendale, MI, USA ; Szakas, J.

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 acquired via remotely-sensed devices providing data in raster(regular or gridded) format. This paper describes parallel algorithms to find the Voronoi Diagram, the furthest site Voronoi diagram and the order-k Voronoi diagram. Prototype implementations in Parallaxes are outlined.

Published in:

Parallel and Distributed Processing Symposium, 2003. Proceedings. International

Date of Conference:

22-26 April 2003