Inhalt Learn how to program and use basic computational geometry algorithms and data structures with the help of the Computational Geometry Algorithms Library (CGAL: http://www.cgal.org/)! Geometric algorithms are important in many areas such as: computer graphics, scientific visualization, computer aided design and modeling, geographic information systems, molecular biology, medical imaging, etc.We will cover several topics such as: Convex Hulls, Triangulations, Arrangements, Polygons etc.Each topic will be sufficiently covered in a lecture; We'll then work on exercises. This is a practical course (the aim is to learn how to work with several CGAL packages). The working programming language wil be C++. CGAL is a library based on generic programming principles, so we'll also learn about CGAL traits classes, kernels, etc.Students can work in teams and each team will also have to work on a final project that will be chosen in class. Note: This course can serve as a good introduction to the Computational Geometry course that will be taught in SS 2013. Zielgruppe Bachelor/Master students that want to learn something about geometric computing, CGAL, computational geometry. Voraussetzungen The students should have knowledge in algorithms, and should have sufficient competence in C++ and generic programming (templates, iterators, containers etc.). Experience with Qt, Boost, etc. will be also helpful but not necessary. Literatur CGAL: http://www.cgal.org/ CGAL Arrangements and Their Applications, E. Fogel, D. Halperin, R. Wein, Springer 2012.Computational Geometry: Algorithms and Applications, Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars, Springer, 2008 (third edition). close