An optimal speed-up parallel algorithm for triangulating simplicial point sets in space

DOI10.1007/BF01414463zbMath0641.68069OpenAlexW2041703479MaRDI QIDQ1100900

Hossam ElGindy

Publication date: 1986

Published in: International Journal of Parallel Programming (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Algorithms in computer science (68W99)

Related Items (2)

An optimal parallel algorithm for triangulating a set of points in the plane ⋮ New parallel algorithms for convex hull and triangulation in 3-dimensional space

Cites Work

• Unnamed Item
• Unnamed Item
• An optimal parallel algorithm for triangulating a set of points in the plane
• Triangulating point sets in space
• Tight Bounds on the Complexity of Parallel Sorting
• Parallel Prefix Computation
• Finding the maximum, merging, and sorting in a parallel computation model
• Automatic triangulation of arbitrary planar domains for the finite element method

This page was built for publication: An optimal speed-up parallel algorithm for triangulating simplicial point sets in space