Authors: Nancy M. Amato

Venue: University of Illinois Urbana-Champaign
DOI:
Link to Publication

Abstract:
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). 

@phdthesis{Amato-pafcha-1995, 
 author = {Nancy M. Amato}, 
 month = {January}, 
 note = {https://search.proquest.com/openview/a46d67f1f648ab5badf409ac3ed51894/1?pq-origsite=gscholar&cbl=18750&diss=y}, 
 school = {Department of Computer Science, University of Illinois at Urbana-Champaign}, 
 title = {Parallel Algorithms for Convex Hulls and Proximity Problems}, 
 year = {1995} 
}