By Topic

A fast algorithm for Voronoi diagram calculation based on distance doubling

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

1 Author(s)
D. Izaelevitz ; Analytic Sci. Corp., Reading, MA

An efficient algorithm is described for calculation of the Voronoi diagram over one- and two-dimensional lattices. The algorithm proceeds by propagating the location of Voronoi points through the lattice using a distance-doubling strategy. This algorithm is designed for implementation on a fine-grain parallel computer such as the Connection Machine. It is shown how the algorithm is extended to calculation of distance-from-region computation and the use of nonstandard metrics. Two algorithms are presented for the calculation of the Voronoi diagrams over one- and two-dimensional lattices. Both algorithms propagate the explicit location of the nearest Voronoi point rather than the distance to the point and so are more accurate than traditional methods. The first algorithm is based on brushfire propagation while the second algorithm relies on distance doubling. It is found that distance-doubling algorithm is more efficient than the classical algorithm when at least one Voronoi polygon is large. It is found that there is little penalty in using the updated brushfire algorithm over the traditional algorithm

Published in:

Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of

Date of Conference:

10-12 Oct 1988