Optimal parallel algorithm for triangulating a set of points in the plane

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

DOI:https://doi.org/10.1007/BF01414464· OSTI ID:5371011

Merks, E

This paper presents an optimal parallel algorithm for triangulating an arbitrary set of n points in the plane. The algorithm runs in O(log n) time using O(n) space and O(n) processors on a Concurrent-Read, Exclusive-Write Parallel RAM model (CREW PRAM). The parallel lower bound on triangulation is Omega(log n) time so the best possible linear speedup has been achieved. A parallel divide-and-conquer technique of subdividing a problem into root n subproblems is employed.

• Research Organization: Simon Fraser Univ., Burnaby, British Columbia (Canada)
• OSTI ID: 5371011
• 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)
ARRAY PROCESSORS
COMPUTERIZED SIMULATION
DATA PROCESSING
DISTRIBUTED DATA PROCESSING
EFFICIENCY
GEOMETRY
MATHEMATICAL MANIFOLDS
MATHEMATICS
OPTIMIZATION
PARALLEL PROCESSING
PERFORMANCE
PROCESSING
PROGRAMMING
SIMULATION
TASK SCHEDULING