Optimal speed-up parallel algorithm for triangulating simplicial point sets in space

Journal Article · Wed Oct 01 00:00:00 EDT 1986 · Int. J. Parallel Program.; (United States)

DOI:https://doi.org/10.1007/BF01414463· OSTI ID:5298958

ElGindy, H

Previous research on developing parallel triangulation algorithms concentrated on triangulating planar point sets. O(log/sup 3/n) running time algorithms using O(n) processors have been developed in Refs. 1 and 2. Atallah and Goodrich/sup (3)/ presented a data structure that can be viewed as a parallel analogue of the sequential plane-sweeping paradigm, which can be used to triangulate a planar point set in O(log n loglog n) time using O(n) processors. Recently Merks/sup (4)/ described an algorithm for triangulating point sets which runs in O(log n) time using O(n) processors, and is thus optimal. In this paper the authors develop a parallel algorithm for triangulating simplicial point sets in arbitrary dimensions based on the idea of the sequential algorithm presented in Ref. 5. The algorithm runs in O(log/sup 2/n) time using O(n/log n) processors. The algorithm has O(n log n) as the product of the running time and the number of processors; i.e., an optimal speed-up.

• Research Organization: Univ. of Pennsylvania, Philadelphia (USA)
• OSTI ID: 5298958
• Journal Information: Int. J. Parallel Program.; (United States), Journal Name: Int. J. Parallel Program.; (United States) Vol. 15:5; ISSN IJPPE
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990210* -- Supercomputers-- (1987-1989)
ALGORITHMS
ARRAY PROCESSORS
COMPUTERIZED SIMULATION
DATA PROCESSING
DISTRIBUTED DATA PROCESSING
EFFICIENCY
GEOMETRY
MATHEMATICAL LOGIC
MATHEMATICAL MANIFOLDS
MATHEMATICS
MEMORY DEVICES
OPTIMIZATION
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING
SIMULATION
TASK SCHEDULING