Efficient parallel convex hull algorithms

DOI10.1109/12.9737zbMath0663.68057OpenAlexW2000050422MaRDI QIDQ3814810

Quentin F. Stout, Russ Miller

Publication date: 1988

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/9abded4e6bc17b5cf2e81f9851f1e6dc0c6bb9aa

zbMATH Keywords

hypercubepyramidconvex hullparallel algorithmscomputational geometryEREW PRAMreconfigurable meshmesh-of-treesAKS network

Mathematics Subject Classification ID

Related Items (18)

Packing two disks in a polygon ⋮ A time-optimal parallel algorithm for three-dimensional convex hulls ⋮ Finding a closet visible vertex pair between two polygons ⋮ COMPUTATION OF THE CONVEX HULL FOR SORTED POINTS ON A RECONFIGURABLE MESH ⋮ Embeddings on a Boolean cube ⋮ Constant time sorting on a processor array with a reconfigurable bus system ⋮ Two dimensional processor array with a reconfigurable bus system is at least as powerful as CRCW model ⋮ Recursion and parallel algorithms in geometric modeling problems ⋮ Efficient convexity and domination algorithms for fine- and medium-grain hypercube computers ⋮ Multilist layering: Complexity and applications ⋮ Fast randomized parallel methods for planar convex hull construction ⋮ Fuzzy clustering using the convex hull as geometrical model ⋮ Real-time fuzzy regression analysis: a convex hull approach ⋮ Dynamic computational geometry on meshes and hypercubes ⋮ Techniques and Open Questions in Computational Convex Analysis ⋮ A filtering technique for fast convex hull construction in \(\mathbb{R}^2\) ⋮ Constant-time Hough transform on the processor arrays with reconfigurable bus systems ⋮ Parallel solutions to geometric problems in the scan model of computation

This page was built for publication: Efficient parallel convex hull algorithms