Computational Geometry: Delaunay Triangulations and Voronoi Diagrams 



Course Overview 

Space decompositions are a key problem in computational geometry. The Delaunay triangulation and its dual, the Voronoi diagram, are arguably the most important decompositions studied in the field. Together, they are used by an impressive number of applications in various areas, e.g., hydrology, crystallography, biology, operations research, fluid dynamics, computer graphics, etc. The goal of this course is to present combinatorial and algorithmic results about Delaunay triangulations and Voronoi diagrams, and to highlight some interesting applications and problems. This course is part of an initiative to promote the field of Computational Geometry in Brazil and to prepare the interested public for the main event in this area, the ACM Symposium on Computational Geometry (SoCG), which will be held in Rio de Janeiro in June 2013. 



PreRequisites 

Elementary geometry 



Instructor 

Marcelo Siqueira 



Lectures 

February 18 to 22, 2013, 10:00 to 12:00, Room 224, IMPA, Rio de Janeiro, RJ, Brazil 



Textbook 

The main reference for this course is:
There are several complementary references that cover (entirely or partially)
the contents of this course:




Syllabus 





Code 

I wrote a simple C++ program for generating Delaunay triangulations of point sets in the Euclidean plane. 



Reading List 







Useful Links 





Last update: February 22, 2013 