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
来源：
ALGORITHMICA | 1999年 / 24卷 / 3-4期
关键词：
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 条
  • [31] Implementing an adaptive Viterbi algorithm in coarse-grained reconfigurable hardware
    Rauwerda, GK
    Smit, GJM
    Brugger, W
    ERSA'05: PROCEEDINGS OF THE 2005 INTERNATIONAL CONFERENCE ON ENGINEERING OF RECONFIGURABLE SYSTEMS AND ALGORITHMS, 2005, : 62 - 68
  • [32] A coarse-grained parallel algorithm for maximal cliques in circle graphs
    Cáceres, EN
    Song, SW
    Szwarcfiter, JL
    COMPUTATIONAL SCIENCE -- ICCS 2001, PROCEEDINGS PT 2, 2001, 2074 : 638 - 647
  • [33] An algorithm for mapping loops onto coarse-grained reconfigurable architectures
    Lee, JE
    Choi, K
    Dutt, ND
    ACM SIGPLAN NOTICES, 2003, 38 (07) : 183 - 188
  • [34] Analysis of crossovers and selections in a coarse-grained parallel genetic algorithm
    Katayama, K
    Hirabayashi, H
    Narihisa, H
    MATHEMATICAL AND COMPUTER MODELLING, 2003, 38 (11-13) : 1275 - 1282
  • [35] A coarse-grained parallel algorithm for spanning tree and connected components
    Cáceres, EN
    Dehne, F
    Mongelli, H
    Song, SW
    Szwarcfiter, JL
    EURO-PAR 2004 PARALLEL PROCESSING, PROCEEDINGS, 2004, 3149 : 828 - 831
  • [36] A Coarse-Grained Multicomputer algorithm for the longest common subsequence problem
    Garcia, T
    Myoupo, JF
    Semé, D
    ELEVENTH EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2003, : 349 - 356
  • [37] Temporal Partitioning Algorithm for a Coarse-grained Reconfigurable Computing Architecture
    Yin, Chongyong
    Yin, Shouyi
    Liu, Leibo
    Wei, Shaojun
    PROCEEDINGS OF THE 2009 12TH INTERNATIONAL SYMPOSIUM ON INTEGRATED CIRCUITS (ISIC 2009), 2009, : 655 - 658
  • [38] A New Algorithm for Construction of Coarse-Grained Sites of Large Biomolecules
    Li, Min
    Zhang, John Z. H.
    Xia, Fei
    JOURNAL OF COMPUTATIONAL CHEMISTRY, 2016, 37 (09) : 795 - 804
  • [39] Extraction algorithm for optimal coarse-grained networks on complex networks
    Zeng, Lang
    Jia, Zhen
    Wang, Yingying
    INTERNATIONAL JOURNAL OF MODERN PHYSICS C, 2019, 30 (11):
  • [40] Multigraining: An algorithm for simultaneous fine-grained and coarse-grained simulation of molecular systems
    Christen, M
    van Gunsteren, WF
    JOURNAL OF CHEMICAL PHYSICS, 2006, 124 (15):
12345