A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers

DOI10.1007/S002240000067zbMATH Open0893.68074OpenAlexW2093250716WikidataQ127972352 ScholiaQ127972352MaRDI QIDQ1384686FDOQ1384686

Authors: Xiaotie Deng, Frank Dehne, P. Dymond, Andreas Fabri, Ashfaq A. Khokhar 

Publication date: 1997

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s002240000067

Recommendations

• Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
• A time-optimal parallel algorithm for three-dimensional convex hulls
• Scalable 2D convex hull and triangulation algorithms for coarse grained multicomputers

zbMATH Keywords

randomized parallel algorithmcoarse-grained multicomputer

Mathematics Subject Classification ID

Distributed algorithms (68W15) Computer system organization (68M99)

Cited In (11)

• A BSP realisation of Jarvis' algorithm
• A coarse-grained multicomputer algorithm for the detection of repetitions
• New parallel algorithms for convex hull and triangulation in 3-dimensional space
• Title not available (Why is that?)
• THE PARALLEL 3D CONVEX HULL PROBLEM REVISITED
• Erratum: Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
• Optimal Parallel Randomized Algorithms for Three-Dimensional Convex Hulls and Related Problems
• A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
• Fast computing of three-dimensional convex hulls using graphics hardware
• Title not available (Why is that?)
• Randomized parallel list ranking for distributed memory multiprocessors.

This page was built for publication: A randomized parallel three-dimensional convex hull algorithm for coarse-grained multicomputers

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