A parallel algorithm for constructing Voronoi diagrams based on point-set adaptive grouping

被引：9

作者：

Wang, Jiechen ^{[1
]}

Cui, Can ^{[2
]}

Rui, Yikang ^{[3
]}

Cheng, Liang ^{[1
]}

Pu, Yingxia ^{[1
]}

Wu, Wenzhou ^{[4
]}

Yuan, Zhenyu ^{[1
]}

机构：

[1] Nanjing Univ, Jiangsu Prov Key Lab Geog Informat Sci & Technol, Nanjing 210093, Jiangsu, Peoples R China

[2] Univ Utrecht, Fac Geosci, Urban & Reg Res Ctr Utrecht, NL-3584 CS Utrecht, Netherlands

[3] Royal Inst Technol, S-10044 Stockholm, Sweden

[4] Inst Geog Sci & Nat Resources Res, State Key Lab Resources & Environm Informat Syst, Beijing 100101, Peoples R China

来源：

CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE | 2014年 / 26卷 / 02期

基金：

中国国家自然科学基金;

关键词：

Voronoi diagrams; parallel algorithm; adaptive grouping; geographical information system; computational geometry;

D O I：

10.1002/cpe.3005

中图分类号：

TP31 [计算机软件];

学科分类号：

081202 ; 0835 ;

摘要：

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 (c) 2013 John Wiley & Sons, Ltd.

引用

页码：434 / 446

页数：13

共 50 条

[31] Parallel Shortest Path Algorithm for Voronoi Diagrams with Generalized Distance Functions
Toss, Julio
Comba, Joao
Raffin, Bruno
2014 27TH SIBGRAPI CONFERENCE ON GRAPHICS, PATTERNS AND IMAGES (SIBGRAPI), 2014, : 212 - 219
[32] A TIME-OPTIMAL PARALLEL ALGORITHM FOR THE COMPUTING OF VORONOI-DIAGRAMS
PREILOWSKI, W
MUMBECK, W
LECTURE NOTES IN COMPUTER SCIENCE, 1989, 344 : 424 - 433
[33] An algorithm for the generation of Voronoi diagrams on the sphere based on QTM
Chen, J
Zhao, XS
Li, ZL
PHOTOGRAMMETRIC ENGINEERING AND REMOTE SENSING, 2003, 69 (01): : 79 - 89
[34] Identification of enclaves and exclaves by computation based on point-set topology
Wang, Xiaonan
INTERNATIONAL JOURNAL OF GEOGRAPHICAL INFORMATION SCIENCE, 2023, 37 (02) : 307 - 338
[35] Improved adaptive and multi-group parallel genetic algorithm based on good-point set
Wang, Ruijiang
Ru, Yihong
Long, Qi
Journal of Software, 2009, 4 (04) : 348 - 356
[36] Parallel mining of uncertain data using segmentation of data set area and Voronoi diagrams
Lukic, Ivica
Hocenski, Zeljko
Kohler, Mirko
Galba, Tomislav
AUTOMATIKA, 2018, 59 (3-4) : 349 - 356
[37] A point-set compression heuristic for fiber-based certificates of authenticity
Kirovski, D
DCC 2005: Data Compression Conference, Proceedings, 2005, : 103 - 112
[38] AN IMPROVED PARALLEL ALGORITHM FOR CONSTRUCTING VORONOI DIAGRAM ON A MESH-CONNECTED COMPUTER
JEONG, CS
PARALLEL COMPUTING, 1991, 17 (4-5) : 505 - 514
[39] A new parallel algorithm for constructing Voronoi tessellations from distributed input data
Starinshak, D. P.
Owen, J. M.
Johnson, J. N.
COMPUTER PHYSICS COMMUNICATIONS, 2014, 185 (12) : 3204 - 3214
[40] A new graph matching method for point-set correspondence using the EM algorithm and Softassign
Sanroma, Gerard
Alquezar, Rene
Serratosa, Francesc
COMPUTER VISION AND IMAGE UNDERSTANDING, 2012, 116 (02) : 292 - 304

← 1 2 3 4 5 →