Course teacher(s)
Stefan LANGERMAN F. SWARZBERG (Coordinator)ECTS credits
5
Language(s) of instruction
english
Course content
This course studies some fundamental problems in computational geometry and several algorithmic concepts that can be used to solve them. Among the topics we will cover: Convex hulls, polygon triangulation, Delaunay triangulations, Voronoi Diagrams, arrangements, projective duality, geometric optimization, linear programming, range searching, point location and other geometric data structures.
Objectives (and/or specific learning outcomes)
To learn basic concepts in computational and combinatorial geometry. How to design efficient algorithms and data structures to solve geometric problems.
Teaching methods and learning activities
Lectures, homeworks, a course project and a project presentation (2nd semester).
References, bibliography, and recommended reading
M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Computational Geometry: Algorithms and Applications, Springer Verlag, 1999. J. O'Rourke, Computational Geometry in C, Second Edition, Cambridge University Press, 1998. F. Preparata. M. Shamos, Computational Geometry}, Springer Verlag, 1985.
Other information
Contacts
Stefan Langerman
Evaluation
Method(s) of evaluation
- Other
Other
Based on participation to Lectures, homeworks, the course project and a project defense/oral exam.
Mark calculation method (including weighting of intermediary marks)
Based on participation to Lectures, homeworks: 10%, course project 40%, project defense/oral exam: 50%
Language(s) of evaluation
- english
- french