Duration
25h Th, 95h Proj.
Number of credits
Lecturer
Language(s) of instruction
English language
Organisation and examination
Teaching in the first semester, review in January
Units courses prerequisite and corequisite
Prerequisite or corequisite units are presented within each program
Learning unit contents
Some classical algorithms in computational geometry are presented, along with methods on how to tacke new problems.
Learning outcomes of the learning unit
Capacity to analyze a geometric problem in order to give an algorithmic answer that
- answers to the problem
- is efficient, also on big sets of input data
- is robust with respect to degenerate cases
- is robust with respect to errors in floating point arithmetic
Prerequisite knowledge and skills
Basics in geometry
Algorithms
Programming language (C / C++)
Planned learning activities and teaching methods
Miniprojetcs along the year + 1 large project
Mode of delivery (face-to-face ; distance-learning)
Lessons in lecture room (face-to-face)
Recommended or required readings
Computational Geometry ,Algorithms and Applications
de Berg, M., Cheong, O., van Kreveld, M., Overmars, M., 3rd ed. 2008, Springer
(electronic copy available at the library)
Assessment methods and criteria
Miniprojects - 10 %
Final project - 90 %
Work placement(s)
Organizational remarks
Contacts
eric.bechet@ulg.ac.be