A parallel algorithm for constructing Voronoi diagrams based on point‐set adaptive grouping. (26th February 2013)

• Record Type: Journal Article
• Authors: Wang, Jiechen; Cui, Can; Rui, Yikang; Cheng, Liang; Pu, Yingxia; Wu, Wenzhou; Yuan, Zhenyu
• Is Part Of: Concurrency and computation. Volume 26:Number 2(2014:Feb.)
• Page Start: 434
• Page End: 446
• Publication Date: 2013-02-26
• Subjects: Parallel processing (Electronic computers) -- Periodicals; Parallel computers -- Periodicals; 004.35
• DOI: 10.1002/cpe.3005
• Languages: English
• ISSNs: 1532-0626

Abstract

<abstract abstract-type="main"> <title>SUMMARY</title> <p>This paper presents a parallel algorithm for constructing Voronoi diagrams based on point‐set adaptive grouping. The binary tree splitting method is used to adaptively group the point set in the plane and construct sub‐Voronoi diagrams for each group. Given that the construction of Voronoi diagrams in each group consumes the majority of time and that construction within one group does not affect that in other groups, the use of a parallel algorithm is suitable. After constructing the sub‐Voronoi diagrams, we extracted the boundary points of the four sides of each sub‐group and used to construct boundary site Voronoi diagrams. Finally, the sub‐Voronoi diagrams containing each boundary point are merged with the corresponding boundary site Voronoi diagrams. This produces the desired Voronoi diagram. Experiments demonstrate the efficiency of this parallel algorithm, and its time complexity is calculated as a function of the size of the point set, the number of processors, the average number of points in each block, and the number of boundary points. Copyright © 2013 John Wiley &amp; Sons, Ltd.</p> </abstract>