Parallel divide-and-conquer scheme for Delaunay triangulation

被引：0

作者：

Chen, MB ^{[1
]}

Chuang, TR ^{[1
]}

Wu, JJ ^{[1
]}

机构：

[1] Chung Kuo Inst Technol, Dept Management Informat Syst, Taipei 116, Taiwan

来源：

NINTH INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS, PROCEEDINGS | 2002年

关键词：

unstructured mesh generation; Delaunay triangulation; parallel algorithm;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

This paper describes a parallel divide-and-conquer algorithm for Delaunay triatigulation. This algorithm finds the affected zone that cover the triangulations that may be modified during the merge of two sub-block triangulations. With the aid of affected zone, communications between processors are reduced, the time complexity of divide-and-conquer remains O(n log n), and the affected zone can be found in O(n) time steps, where n is the number of points. The code was implemented with C, FORTRAN and MPI, so it was easy to port this program to other machines. Experimental results on IBM SP2 show that a parallel efficiency of 34%-96%for general distributions can be achieved on an 16-node distributed memory system.

引用

页码：571 / 576

页数：6

共 50 条

[41] An Efficient Parallel Divide-and-Conquer Algorithm for Generalized Matrix Multiplication
Eagan, John
Herdman, Marc
Vaughn, Christian
Bean, Nathaniel
Kern, Sarah
Pirouz, Matin
2023 IEEE 13TH ANNUAL COMPUTING AND COMMUNICATION WORKSHOP AND CONFERENCE, CCWC, 2023, : 442 - 449
[42] A parallel symmetric block-tridiagonal divide-and-conquer algorithm
Bai, Yihua
Ward, Robert C.
ACM TRANSACTIONS ON MATHEMATICAL SOFTWARE, 2007, 33 (04):
[43] A divide-and-conquer method with approximate Fermi levels for parallel computations
Takeshi Yoshikawa
Hiromi Nakai
Theoretical Chemistry Accounts, 2015, 134
[44] A PARALLEL DIVIDE-AND-CONQUER ALGORITHM FOR FINDING MINIMUM ENERGY TRAJECTORIES
Leandro, Carlos
Ambrosio, Jorge
PROCEEDINGS OF THE 7TH INTERNATIONAL CONFERENCE ON MECHANICS AND MATERIALS IN DESIGN (M2D2017), 2017, : 155 - 156
[45] Automated transformation of sequential divide-and-conquer algorithms into parallel programs
Freisleben, B
Kielmann, T
COMPUTERS AND ARTIFICIAL INTELLIGENCE, 1995, 14 (06): : 579 - 596
[46] Parallel implementation of divide-and-conquer semiempirical quantum chemistry calculations
Pan, W
Lee, TS
Yang, WT
JOURNAL OF COMPUTATIONAL CHEMISTRY, 1998, 19 (09) : 1101 - 1109
[47] A divide-and-conquer method with approximate Fermi levels for parallel computations
Yoshikawa, Takeshi
Nakai, Hiromi
THEORETICAL CHEMISTRY ACCOUNTS, 2015, 134 (05)
[48] Parallel skeletons for Divide-and-Conquer and Branch-and-Bound techniques
Dorta, I
León, C
Rodríguez, C
Rojas, A
ELEVENTH EUROMICRO CONFERENCE ON PARALLEL, DISTRIBUTED AND NETWORK-BASED PROCESSING, PROCEEDINGS, 2003, : 292 - 298
[49] Divide-and-conquer algorithms on the hypercube
Mayr, EW
Werchner, R
THEORETICAL COMPUTER SCIENCE, 1996, 162 (02) : 283 - 296
[50] A parallel processing method of divide-and-conquer and a highly efficient parallel sorting algorithm
Huang, Minghe
Zhong, Cuixiang
Dai, Liping
Lei, Gang
DCABES 2006 Proceedings, Vols 1 and 2, 2006, : 86 - 88

← 1 2 3 4 5 →