Computational Geometry

Academic year: 2010-2011 Course code module MINF20021 Semester: 1st semester Credits: 3 Study load (hours) 84 Theory (hours): 15,00 Practice/Exercises(hours): 10,00 Other (hours): Part-time program: Instructor(s) Rudi Penne Language of instruction: English Semester exam information: exam in the 1st semester Contract restriction information: 1. Prerequisites *Algemene competenties Basic knowledge of algorithms (e.g. sorting). Basic knowledge in (euclidean) geometry (plane, 3-space).. *Sequentiality None 2. Objectives (expected learning outcomes) Students will reach the minimal mathematical background to analyse the geometric issues of the field. Students will master the fundamentals of algorithmic design, as there are:  "divide-and-conquer", "incremental method", "line sweep", "duality", "randomizing",... Students know the initial concepts from Projective Geometry (homogeneous coordinates, homographies,...) 3. Course content We design and analyse algorithms for: intersection problems localisation visibility convex hulls Minkowski sums triangulations Voronoi diagrams 4. Teaching method Direct contact: Lectures Seminars (possible question and answer sessions) Personal work: Exercises Assignments - individual Project-based work - individual 5. Assessment method Written assignment: With oral presentation Presentation 6. Compulsory reading – study material Check http://www.win.ua.ac.be/~penne/licuia.html 7. Recommended reading - study material Check http://www.win.ua.ac.be/~penne/licuia.html 8. Tutoring The lecturer will be available before and after the lectures. laatste aanpassing: last update: 08/01/2010 09:48 rudi.penne