The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1988 vol.37)
pp: 1605-1618
ABSTRACT
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
INDEX TERMS
parallel algorithms; convex hull algorithms; planar points; hypercube; pyramid; mesh-of-trees; EREW PRAM; modified AKS network; convex hull; computational geometry; parallel algorithms.
CITATION
R. Miller, Q.F. Stout, "Efficient Parallel Convex Hull Algorithms", IEEE Transactions on Computers, vol.37, no. 12, pp. 1605-1618, December 1988, doi:10.1109/12.9737
6 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool