A 2-D parallel convex hull algorithm with optimal communication phases

DOI10.1016/S0167-8191(00)00097-1MaRDI QIDQ5940910zbMATH OpenOpenAlexWikidataFDO

Authors P. Dymond, J. Zhou, Xiaotie Deng

Publication date 20 August 2001

Published in Parallel Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0167-8191(00)00097-1

zbMATH Keywords

Coarse-grained parallel computer

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• Efficient parallel convex hull algorithms
• A sublogarithmic convex hull algorithm
• Two parallel algorithms for the convex hull problem in a two dimensional space
• A FAST PARALLEL ALGORITHM FOR FINDING THE CONVEX HULL OF A SORTED POINT SET
• Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers

Cited in

(8)

• Two parallel algorithms for the convex hull problem in a two dimensional space
• Distributed algorithm for the planar convex hull problem
• Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers
• Fast spherical centroidal Voronoi mesh generation: a Lloyd-preconditioned LBFGS method in parallel
• scientific article; zbMATH DE number 1196828 (Why is no real title available?)
• scientific article; zbMATH DE number 2090610 (Why is no real title available?)
• Comments on two parallel algorithms for the planar convex hull problem
• Design and implementation of a massively parallel version of DIRECT

Describes a project that uses

Uses Software

• Hull

This page was built for publication: A 2-D parallel convex hull algorithm with optimal communication phases

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