Background in Design and Analysis of Algorithms or Instructor's permission. Seniors are encouraged to take this course.
Computational geometry is the study of algorithms for solving geometric problems on a computer.
The goal of the course is to teach the fundamental paradigms for designing efficient algorithms dealing with collections of geometric objects such as points, lines, line segments, planes, or higher dimensional objects. The class assignments will consist of homework problems, a midterm exam, a term project and a final exam. Higher Dimensional Convex Hull. Rectangle Intersection Problem. The focus is on algorithms and hence the book is well suited for students in computer science and engineering.