LMECA 2170 · Computational GeometryWinter 2015 · Universite catholique de Louvain

LECTURES: 
Monday 10:4512:15, Euler Building 
INSTRUCTORS: 
Prs. JeanFrancois Remacle and Vincent Legat Euler Building Office hours: By appointment. 
COURSE DESCRIPTION 
The course will mainly deal with mesh
generation. The following topics will be introduced:
Delaunay triangulations, Voronoi Diagrams, triangle meshes,
combinatorial topology, surface simplification,
delaunay tetrahedrizations, tetrahedron meshes,
parametrization of surface meshes, surface
meshing, quadrilateral and hexahedral mesh generation, geometrical
primitives and numerical robustness. Prerequisite: Some programming experience in C or C++ is required. 
ASSIGNEMENT: 
A computer program will have to be developed by groups of maximum 2 students. The aim of the code will be to develop a fast Delaunay triangulation algorithm in 2D or in 3D. Details of this assignment can be found here . 
GRADING: 
The final grade involves an oral exam (accounts for 30% of the final grade) and the project (accounts for 70% of the final grade) Both exactness and robustness of the code as well as its efficiency will be taken into account in the evaluation. 
RECOMMENDED 
Mark de Berg, Otfried Cheong, Marc van Kreveld, and Mark
Overmars, Computational Geometry: Algorithms and Applications, third
edition, SpringerVerlag, 2008. ISBN # 978354077
9735. Or, second revised edition, SpringerVerlag,
2000. ISBN # 3540656200. Edelsbrunner, H. (2001). Geometry and topology for mesh generation. Cambridge University Press. Jonathan Richard Shewchuk, Lecture Notes on Geometric Robustness. 
GMSH 
Open Source Mesh Generator
. 