Parallel divide-and-conquer scheme for 2D Delaunay triangulation: Research Articles

Authors:
Min-Bin Chen;Tyng-Ruey Chuang;Jan-Jan Wu
Affiliations:
Department of Management Information Systems, Chung Kuo Institute of Technology, Mucha, Taipei 116, Taiwan;Institute of Information Science, Academia Sinica, Nankang, Taipei 115, Taiwan;Institute of Information Science, Academia Sinica, Nankang, Taipei 115, Taiwan
Venue:
Concurrency and Computation: Practice & Experience
Year:
2006

Citing 0
Cited 3

Parallel geometric algorithms for multi-core computers

Computational Geometry: Theory and Applications
A parallel algorithm based on convexity for the computing of Delaunay tessellation

Numerical Algorithms
Parallel Delaunay triangulation-Application to two dimensions

Finite Elements in Analysis and Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

This work describes a parallel divide-and-conquer Delaunay triangulation scheme. This algorithm finds the affected zone, which covers the triangulation and may be modified when two sub-block triangulations are merged. Finding the affected zone can reduce the amount of data required to be transmitted between processors. The time complexity of the divide-and-conquer scheme remains O(n log n), and the affected region can be located in O(n) time steps, where n denotes the number of points. The code was implemented with C, FORTRAN and MPI, making it portable to many computer systems. Experimental results on an IBM SP2 show that a parallel efficiency of 44–95% for general distributions can be attained on a 16-node distributed memory system. Copyright © 2006 John Wiley & Sons, Ltd.