- Clearly discuss the application
- formally define the geometric problems needed to be solved
- discussion of existing approaches and evaluation of their quality
- your ideas of improving these approach
- references of the paper that you read

## CS-591: Computational Geometry: Theory and Applications

This CS-591 is the test-run of our newly developed course on computational geometry and its applications. After this semester, it will be proposed to be taught as a regualar graduate course. It is introduced to provide interdiciplinary education to graduate and senior undergraduate students in and to bridge interdiciplinary educational gap in computer science, applied mathematics, and computational science and engineering. This course is designed to help improve students' algorithmic and analytical maturity, to show studends its interesting algorithmic applications. It is also designed for providing research topics for interested graduate students. 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.

## Why Computational Geomtry?

In various interdiciplinary applications such as scientific computing, computer vision, scientific visualization, computational biology, computer graphics, robotics, network design, and information organization, we need algorithms to solve various geometric problems and design efficient geometric data structures. This course will make our students better prepared for for algorithm design, analysis, other interdiciplinary courses.

CAS CS 330;

We will try to make this course as self-contained as possible.

M 10:00 am -- 1:00 pm in room SED 208

a. Two homework assignments

b. One Programming Assignment

c. Final Research Project

d. Note Scribing

e. This class has no exam

Handouts Recent Research Papers" Computational Geometry: Algorithms and Applications " Second Edition by Mark de Berg, Marc van Kreveld, Mark Overmars and Otfried Schwarzkopf

Useful links