Title:  CS-591: Computational Geometry: Theory and Applications
Instructor: Dr. Teng

This CS-591 is the test-run of our newly developed graduate course on 
computational geometry and its applications. After this semester, it 
will be taught as a regular graduate course. It is 
introduced to provide interdisciplinary education to graduate and senior 
undergraduate students and to bridge the gap 
between computer science, applied mathematics, and computational science and 
engineering. This course is designed to help improve students' 
algorithmic and analytical maturity, and to show students interesting 
algorithmic applications. It is also designed to provide research 
topics for interested graduate students.

What is Computational Geometry?

  Computational geometry is the field of theoretical computer science 
devoted to the design, analysis, and implementation of algorithms and 
data structures to solve geometric problems. These problems arise in 
several different areas, including computer graphics, robotics, 
databases, data mining, parallel computing, statistics, and pure math. 
Their solutions combine traditional algorithmic techniques with 
beautiful results from combinatorics, geometry, and other mathematical 
areas. 

Prerequisites: CAS CS 330