Computational geometry: an introduction
Computational geometry: an introduction
The ultimate planar convex hull algorithm
SIAM Journal on Computing
Type architectures, shared memory, and the corollary of modest potential
Annual review of computer science vol. 1, 1986
Efficient parallel solutions to some geometric problems
Journal of Parallel and Distributed Computing
On communication latency in PRAM computations
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
A bridging model for parallel computation
Communications of the ACM
A comparison of sorting algorithms for the connection machine CM-2
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
General purpose parallel architectures
Handbook of theoretical computer science (vol. A)
Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems
SIAM Journal on Computing
LogP: towards a realistic model of parallel computation
PPOPP '93 Proceedings of the fourth ACM SIGPLAN symposium on Principles and practice of parallel programming
An NC parallel 3D convex hull algorithm
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Scalable parallel geometric algorithms for coarse grained multicomputers
SCG '93 Proceedings of the ninth annual symposium on Computational geometry
Four results on randomized incremental constructions
Computational Geometry: Theory and Applications
Parallel sorting by over partitioning
SPAA '94 Proceedings of the sixth annual ACM symposium on Parallel algorithms and architectures
A randomized parallel 3D convex hull algorithm for coarse grained multicomputers
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Towards efficiency and portability: programming with the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Deterministic sorting and randomized median finding on the BSP model
Proceedings of the eighth annual ACM symposium on Parallel algorithms and architectures
Communication-efficient parallel sorting (preliminary version)
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Randomized Algorithm for Voronoi Diagram of Line Segments on Coarse-Grained Multiprocessors
IPPS '96 Proceedings of the 10th International Parallel Processing Symposium
Efficient routing and message bounds for optimal parallel algorithms
IPPS '95 Proceedings of the 9th International Symposium on Parallel Processing
Direct Bulk-Synchronous Parallel Algorithms
SWAT '92 Proceedings of the Third Scandinavian Workshop on Algorithm Theory
A Convex Hull Algorithm on Coarse-Grained Multiprocessors
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
Scalable 2d convex hull and triangulation algorithms for coarse grained multicomputers
SPDP '95 Proceedings of the 7th IEEE Symposium on Parallel and Distributeed Processing
Parallel algorithms for geometric problems
Parallel algorithms for geometric problems
Parallel algorithms for higher-dimensional convex hulls
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
Sorting networks and their applications
AFIPS '68 (Spring) Proceedings of the April 30--May 2, 1968, spring joint computer conference
Parallel Geometric Algorithms in Coarse-Grain Network Models
COCOON '98 Proceedings of the 4th Annual International Conference on Computing and Combinatorics
| Hi-index | 0.00 |
We investigate the problem of finding the two-dimensional convex hull of a set of points on a coarse-grained parallel computer. Recently Goodrich has devised a parallel sorting algorithm for n items on P processors which achieves an optimal number of communication phases for all ranges of P