#### Filter Results:

#### Publication Year

1995

2002

#### Publication Type

#### Co-author

#### Publication Venue

#### Key Phrases

Learn More

This paper will present the implementation and comparison of new parallel algorithms for the convex hull problem. These algorithms are a parallel adaptation of the Jarvis March and the Quickhull algorithms. The computational model selected for these algorithms is the associative computing model ASC and the multiple associative computing model MASC. Both… (More)

This paper presents a new parallel algorithm for the convex hull problem. This algorithm is a p arallel adaptation of the Graham Scan Algorithm. The computational model selected for this algorithm is the associative computing model ASC which supports massive parallelism through the use of data par-allelism and constant time associative search and maximum… (More)

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 par-allelism and constant time associative search and… (More)

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… (More)

- ‹
- 1
- ›