Efficient Parallel Convex Hull Algorithms

Authors:
R. Miller;Q. F. Stout
Affiliations:
State Univ. of New York, Buffalo;Univ. of Michigan, Ann Arbor
Venue:
IEEE Transactions on Computers
Year:
1988

Citing 23
Cited 21

Computational geometry: an introduction

Computational geometry: an introduction
The connection machine

The connection machine
A logarithmic time sort for linear size networks

Journal of the ACM (JACM)
A microprocessor-based hypercube supercomputer

IEEE Micro
Data movement techniques for the pyramid computer

SIAM Journal on Computing
Efficient parallel solutions to some geometric problems

Journal of Parallel and Distributed Computing
Finding the convex hull of a sorted point set in parallel

Information Processing Letters
Sorting in c log n parallel steps

Combinatorica
Tight bounds on the complexity of parallel sorting

IEEE Transactions on Computers
Mesh Computer Algorithms for Computational Geometry

IEEE Transactions on Computers
Meshes with reconfigurable buses

Proceedings of the fifth MIT conference on Advanced research in VLSI
Parallel algorithms for regular architectures: meshes and pyramids

Parallel algorithms for regular architectures: meshes and pyramids
Parallel permutation and sorting algorithms and a new generalized connection network

Journal of the ACM (JACM)
Array processor with multiple broadcasting

ISCA '85 Proceedings of the 12th annual international symposium on Computer architecture
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM
Convex hulls of finite sets of points in two and three dimensions

Communications of the ACM
Algorithm-Structured Computer Arrays and Networks: Architectures and Processes for Images, Precepts, Models, Information

Algorithm-Structured Computer Arrays and Networks: Architectures and Processes for Images, Precepts, Models, Information
Parallel algorithms for the convex hull problem in two dimensions

CONPAR '81 Proceedings of the Conference on Analysing Problem Classes and Programming for Parallel Computing
Bounds on the time for parallel RAM's to compute simple functions

STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
A lower bound to finding convex hulls

A lower bound to finding convex hulls
The Image Understanding Architecture

The Image Understanding Architecture
Computational geometry.

Computational geometry.
Computational Aspects of VLSI

Computational Aspects of VLSI

Simulating Essential Pyramids

IEEE Transactions on Computers
Randomized algorithms for binary search and load balancing with geometric applications

SPAA '90 Proceedings of the second annual ACM symposium on Parallel algorithms and architectures
Parallel solutions to geometric problems in the scan model of computation

Journal of Computer and System Sciences
Efficient Geometric Algorithms on the EREW PRAM

IEEE Transactions on Parallel and Distributed Systems
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Podality-Based Time-Optimal Computations on Enhanced Meshes

IEEE Transactions on Parallel and Distributed Systems
An O((log log n)2) Time Algorithm to Compute the Convex Hull of Sorted Points on Reconfigurable Meshes

IEEE Transactions on Parallel and Distributed Systems
The Mesh with Hybrid Buses: An Efficient Parallel Architecture for Digital Geometry

IEEE Transactions on Parallel and Distributed Systems
Randomized fully-scalable BSP techniques for multi-searching and convex hull construction

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Packing two disks in a polygon

Computational Geometry: Theory and Applications
Optimal Parallel Hypercube Algorithms for Polygon Problems

IEEE Transactions on Computers
Constant Time Algorithms for the Transitive Closure and Some Related Graph Problems on Processor Arrays with Reconfigurable Bus Systems

IEEE Transactions on Parallel and Distributed Systems
Square Meshes Are Not Optimal for Convex Hull Computation

IEEE Transactions on Parallel and Distributed Systems
Parallel Convex Hull Computation by Generalised Regular Sampling

Euro-Par '02 Proceedings of the 8th International Euro-Par Conference on Parallel Processing
Efficient List Ranking Algorithms on Reconfigurable Mesh

COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
An O((log log n)2) Time Convex Hull Algorithm on Reconfigurable Meshes

IPPS '98 Proceedings of the 12th. International Parallel Processing Symposium on International Parallel Processing Symposium
Recursion and parallel algorithms in geometric modeling problems

Cybernetics and Systems Analysis
The system of common algorithmic space to create visual models of phenomena and processes

Proceedings of the International Conference on Applications of Computer and Information Sciences to Nature Research
Parallel algorithms

Algorithms and theory of computation handbook
gHull: A GPU algorithm for 3D convex hull

ACM Transactions on Mathematical Software (TOMS)
A Randomized Parallel Three-Dimensional Convex Hull Algorithm for Coarse-Grained Multicomputers

Theory of Computing Systems

Quantified Score

Hi-index	14.99

Visualization

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.