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.
It has numeruous application domains including computer graphics,
visualization, robotics, computational biology, data mining,
parallel computing, and scientific computing.
This course will survey the fundamental concepts in geometric
algorithms and data structures.
Topics that will be covered include
Convex hulls
Plane-sweep algorithms
Triangulations
Geometric data structures
Range searching
Point location
Voronoi diagrams
Delaunay triangulations
|
Randomized algorithms
Arrangements
Nearest neighbors
Surface simplification
Morse theory
Robot motion planning
Visibility graphs
Protein modeling
|