By Topic

Constructing the Voronoi Diagram of Planar Point Set in Parallel

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
$31 $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

3 Author(s)
Lanfang Dong ; Anhui Province Key Lab. of Software In Comput. & Commun., USTC, Hefei, China ; Yuan Wu ; Shanhai Zhou

By researching Voronoi diagram, parallel algorithm, and divide-and-conquer method, we present a special data structure(change doubly-connected list little) for Voronoi diagram generation in parallel. In this paper we also present two proposal, they are one processor gradually to merge and 22-merger on the parallel machine, the experiment results show that the present algorithm runs faster than the serial program. By analyzing the various results, we should choose the most suitable number of processors according to the point set scale. At last, we can conclude that gradually merger with one processor is better proposal for Voronoi diagram parallel generation.

Published in:

Computational Intelligence and Software Engineering, 2009. CiSE 2009. International Conference on

Date of Conference:

11-13 Dec. 2009