Issue No. 12 - December (1988 vol. 37)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.9737
Parallel algorithms are presented to identify (i.e. detect and enumerate) the extreme points of the convex hull of a set of planar points using a hypercube, pyramid, tree, mesh-of-trees, mesh with reconfigurable bus, exclusive-read-exclusive-write parallel random-access machine (EREW PRAM), and modified AKS network. It is shown that the problem of identifying the convex hull for a set of planar
parallel algorithms; convex hull algorithms; planar points; hypercube; pyramid; mesh-of-trees; EREW PRAM; modified AKS network; convex hull; computational geometry; parallel algorithms.
R. Miller and Q. Stout, "Efficient Parallel Convex Hull Algorithms," in IEEE Transactions on Computers, vol. 37, no. , pp. 1605-1618, 1988.