This course is concerned with the design and analysis of algorithms for solving geometric problems. Geometric problems arise in such fields as image processing, computer vision, graphics, VLSI, spatial planning, and robotics. Topics to be covered include: convex hulls, triangulations, proximity graphs, covering problems, nearest neighbour searching, point inclusion problems, polygonal visibility, extremal polygons, polygon decomposition, distance computations, the diameter of a set, and intersection problems.
The solutions to the problems above will involve both sequential and parallel algorithms, with a particular emphasis on those algorithms that can be implemented in P4 or PVM.
Prerequisites
CS484 or permission of the instructor.
Text
F. Preparata and I. Shamos, Computational Geometry - An Introduction, Springer-Verlag, Berlin, Heidelberg, New York, 1990.
and
A number of relevant research papers