Computational Geometry

Course content

Participants know basic modeling for geometric algorithms. They can gauge the algorithmic difficulty of geometric problems and formulate appropriate objectives. They can master different solution techniques and are capable of developing algorithmic methods for new problems. They understand the practical relevance of problems and solutions.

Content

• Geometric problems and data structures •
• Convex hulls
• Closest pairs
• Voronoi diagrams
• Point triangulation
• Polygon triangulation
• Tour problems
• Other advanced research topics