An Associative Dynamic Convex Hull Algorithm

Department of Computer Science
Author(s)
Abstract

This paper presents a new parallel algorithm for the dynamic convex hull problem. This algorithm is a parallel adaptation of the Jarvis March Algorithm. 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.
Format
Article
Publication Date
1998-10
Publication Title
Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems
First Page
250
Last Page
254
Keywords
Subject
Rights
http://rightsstatements.org/vocab/InC/1.0/
Community
Department of Computer Science
Permalink https://oaks.kent.edu/kenneth-e-batcher-collection/associative-dynamic-convex-hull-algorithm
Atwah, M., & Baker, J. (1998). An Associative Dynamic Convex Hull Algorithm (1–). Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems. https://oaks.kent.edu/node/17415
Atwah, Maher, and Johnnie Baker. 1998. “An Associative Dynamic Convex Hull Algorithm”. Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems. https://oaks.kent.edu/node/17415.
Atwah, Maher, and Johnnie Baker. An Associative Dynamic Convex Hull Algorithm. Proceedings of the Tenth IASTED International Conference on Parallel and Distributed Computing and Systems, Oct. 1998, https://oaks.kent.edu/node/17415.