Parallel algorithms for convex hulls and proximity problems

Computational geometry is concerned with the algorithmic aspects of solving geometric problems. The problems are motivated from and have application to such diverse areas as computer graphics, robotics, computer vision, and operations research. Problems arising from these areas of application are good candidates for parallelization since they often have both intense computational needs and stringent response time requirements. Motivated by these concerns, this thesis investigates parallel algorithms for some basic geometric problems. The model of parallel computation used in our studies is the Parallel Random Access Machine (CREW PRAM).

Name thesis:degree_name

Ph.D.

Level thesis:degree_level

Dissertation

Discipline thesis:degree_discipline

Computer Science

Grantor

University of Illinois at Urbana-Champaign

Year dc:date

2011

Author dc:creator

• Amato, Nancy M.

Contributors dc:contributor

• Preparata, Franco P.

• Computer Science

Statement dc:rights

• Copyright 1995 Amato, Nancy Marie

Language dc:language

eng

Identifier

AAI9522076
(UMI)AAI9522076

OAI identifier oai:identifier

oai:www.ideals.illinois.edu:2142/21857