Lecture 3 hours; 3 credits.
Prerequisite: CS483 or equivalent.
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.