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

被引:5
|
作者
Deng, XT [1 ]
Zhu, BH
机构
[1] York Univ, Dept Comp Sci, N York, ON M3J 1P3, Canada
[2] City Univ Hong Kong, Dept Comp Sci, Kowloon, Peoples R China
[3] Los Alamos Natl Lab, Grp CIC3, Los Alamos, NM 87545 USA
关键词
coarse-grained parallel algorithms; Voronoi diagram; computational geometry;
D O I
10.1007/PL00008263
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
We present a randomized algorithm for computing the Voronoi diagram of line segments using coarse-grained parallel machines. Operating on P processors, for any input of n line segments, this algorithm performs O((n log n)/P) local operations per processor, O(n/P) messages per processor, and O(1) communication phases, with high probability for n = Omega (P3+epsilon).
引用
收藏
页码:270 / 286
页数:17
相关论文
共 50 条