An Associative Static and Dynamic Convex Hull Algorithm

Authors:
Maher M. Atwah;Johnnie W. Baker
Affiliations:
-;-
Venue:
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
Year:
2002

Citing 5
Cited 2

Computational geometry: an introduction

Computational geometry: an introduction
Associative Computing: A Programming Paradigm for Massively Parallel Computers

Associative Computing: A Programming Paradigm for Massively Parallel Computers
ASC: An Associative-Computing Paradigm

Computer
Computational geometry.

Computational geometry.
Computational Geometry on a Systolic Chip

IEEE Transactions on Computers

Timing for Associative Operations on the MASC Model

IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Comparisons of air traffic control implementations on an associative processor with a MIMD and consequences for parallel computing

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a new static and dynamic recursive parallel algorithm for the convex hull problem. This algorithm is a parallel adaptation of the Graham Scan and Quick Hull algorithms. The computational model selected for this algorithm is the associative computing model (ASC) which supports massive parallelism through the use of data parallelism and constant time associative search and maximum functions. Also, ASC can be supported on existing SIMD computers. The static algorithm requires O(n) space, O(log n) average case running time, and O(n) worst case running time. If O(log n) ISs are used the, static algorithm should have an average running time of O(log log n).