Title :
Efficient parallel convex hull algorithms
Author :
Miller, Russ ; Stout, Quentin F.
Author_Institution :
Dept. of Comput. Sci., State Univ. of New York, Buffalo, NY, USA
fDate :
12/1/1988 12:00:00 AM
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 points given arbitrarily, cannot be solved faster than sorting
Keywords :
computational geometry; parallel algorithms; EREW PRAM; convex hull; convex hull algorithms; hypercube; mesh-of-trees; modified AKS network; parallel algorithms; planar points; pyramid; Computational geometry; Computational modeling; Concurrent computing; Data structures; Helium; Hypercubes; Parallel algorithms; Phase change random access memory; Solid modeling; Sorting;
Journal_Title :
Computers, IEEE Transactions on
