A constant-time parallel algorithm for computing convex hulls
From MaRDI portal
Publication:1162818
DOI10.1007/BF01944471zbMath0482.68065MaRDI QIDQ1162818
Publication date: 1982
Published in: BIT (Search for Journal in Brave)
52-04: Software, source code, etc. for problems pertaining to convex and discrete geometry
68T10: Pattern recognition, speech recognition
68R99: Discrete mathematics in relation to computer science
Related Items
Optimal parallel algorithms for computing convex hulls and for sorting, 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, A filtering technique for fast convex hull construction in \(\mathbb{R}^2\)
Cites Work