A constant-time parallel algorithm for computing convex hulls

DOI10.1007/BF01944471zbMath0482.68065MaRDI QIDQ1162818

Selim G. Akl

Publication date: 1982

Published in: BIT (Search for Journal in Brave)

zbMATH Keywords

sequential algorithmparallel algorithm22, 130-134 (1982)

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to convex and discrete geometry (52-04) Pattern recognition, speech recognition (68T10) Discrete mathematics in relation to computer science (68R99)

Related Items (4)

Optimal parallel algorithms for computing convex hulls and for sorting ⋮ A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) ⋮ Delaunay triangulation and the convex hull of n points in expected linear time ⋮ Sorting and computing convex hulls on processor arrays with reconfigurable bus systems

Cites Work

• An efficient algorithm for determining the convex hull of a finite planar set
• Sorting on a mesh-connected parallel computer
• Parallel Computations in Graph Theory
• New Parallel-Sorting Schemes
• Bitonic Sort on a Mesh-Connected Parallel Computer
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A constant-time parallel algorithm for computing convex hulls