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

DOI10.1007/S002240000067MaRDI QIDQ1384686zbMATH OpenOpenAlexWikidataFDO

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

zbMATH Keywords

randomized parallel algorithmcoarse-grained multicomputer

Mathematics Subject Classification ID

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

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

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
• scientific article; zbMATH DE number 2090610 (Why is no real title available?)
• 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
• Fast computing of three-dimensional convex hulls using graphics hardware
• A randomized parallel algorithm for Voronoi diagrams based on symmetric convex distance functions
• scientific article; zbMATH DE number 1857643 (Why is no real title available?)
• 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)