Comments on two parallel algorithms for the planar convex hull problem

DOI10.1016/0167-8191(87)90045-7MaRDI QIDQ579833zbMATH OpenOpenAlexFDO

Authors Ivan Stojmenović, D. J. Evans

Publication date 1987

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8191(87)90045-7

zbMATH Keywords

convex hull problemMIMD systemsparallel algorithmsperformance analysis

Mathematics Subject Classification ID

Numerical approximation and computational geometry (primarily algorithms) (65D99) Parallel numerical computation (65Y05) Software, source code, etc. for problems pertaining to computer science (68-04) Searching and sorting (68P10) Pattern recognition, speech recognition (68T10)

Review text

In this note some comments on the paper of the second author and \textit{S. Mai} [Parallel Comput. 2, 313-326 (1985; Zbl 0591.65024)] are given.

Recommendations

• Two parallel algorithms for the convex hull problem in a two dimensional space
• Parallelization alternatives and their performance for the convex hull problem
• scientific article; zbMATH DE number 1196828
• A 2-D parallel convex hull algorithm with optimal communication phases
• Parallel algorithms for some functions of two convex polygons
• scientific article; zbMATH DE number 3945382
• Efficient parallel convex hull algorithms
• Optimal, output-sensitive algorithms for constructing planar hulls in parallel
• Fast randomized parallel methods for planar convex hull construction

Cited in

(1)

• Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems

This page was built for publication: Comments on two parallel algorithms for the planar convex hull problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q579833)