Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers

DOI10.1006/JPDC.1998.1503zbMATH Open0924.68095OpenAlexW2010213237MaRDI QIDQ1284136FDOQ1284136

Authors: Andrew Rau-Chaplin, Stéphane Ubéda, Mohamadou Malal Diallo, Afonso G. Ferreira 

Publication date: 17 November 1999

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jpdc.1998.1503

Recommendations

• SCALABLE PARALLEL COMPUTATIONAL GEOMETRY FOR COARSE GRAINED MULTICOMPUTERS
• A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers
• A 2-D parallel convex hull algorithm with optimal communication phases

zbMATH Keywords

coarse grained multicomputer

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Cited In (6)

• Distributed algorithm for the planar convex hull problem
• Finding coarse grained parallelism in computational geometry algorithms
• A 2-D parallel convex hull algorithm with optimal communication phases
• Efficient parallel graph algorithms for coarse grained multicomputers and BSP
• Scalable algorithms for bichromatic line segment intersection problems on Coarse Grained Multicomputers
• Scalable parallel algorithms for geometric pattern recognition

This page was built for publication: Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers

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