By Topic

A randomized algorithm for Voronoi diagram of line segments on coarse grained multiprocessors

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)
Xiaotie Deng ; Dept. of Comput. Sci., York Univ., North York, Ont., Canada ; Binhai Zhu

We present a randomized parallel algorithm for the Voronoi diagram of line segments on coarse grained parallel machines, which, for any input of n line segments on P processors (n=Ω(P3+ε), for any ε>0) requires (with high probability) O([n log n/P]) local operations, O(n/P) global-operations (or messages) per processor, O(1) levels of global data dependency (or O(1) communication phases). This generic parallel algorithm can be transformed to the CRCW PRAM model in O(log n) time with O(n) processors and thus provides a different solution from, and conceptually much simpler than, that of (Rajasekaran, 1994)

Published in:

Parallel Processing Symposium, 1996., Proceedings of IPPS '96, The 10th International

Date of Conference:

15-19 Apr 1996