Sciweavers

Share
IPPS
2002
IEEE

An Associative Static and Dynamic Convex Hull Algorithm

10 years 2 months ago
An Associative Static and Dynamic Convex Hull Algorithm
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).
Maher M. Atwah, Johnnie W. Baker
Added 15 Jul 2010
Updated 15 Jul 2010
Type Conference
Year 2002
Where IPPS
Authors Maher M. Atwah, Johnnie W. Baker
Comments (0)
books