The course is in June 2005. The work is performed in groups of three students. Every group has to present their results in a 30 min presentation. In addition each group has to preprar a poster which summarizes theirproject.
Kursets varighed:
3-uger
Evalueringsform:
Hjælpemidler:
Bedømmelsesform:
Overordnede kursusmål:
To teach the students to understand a problem and the methods needed for solving it by self study. To deepen the understanding of algorithms and data structure. Combine the above with skills acquired in Introductory Programming and Software Engineering
Kursusindhold:
The course focuses at problems fraom computational geometry. The student may choose one of two (three) topics which are Polygonal triangulations. Orthogonal range queries in two dimensions. A randomize algorithm for convex hulls in two dimensions. The students have to: Learn those cocepts from Computational Geometry needed to solve the problem. Describe and analyse the problem. Describe the solution algorithm. Decide what should be visualized and how it is done. Design a program structure for implementing thsi. Implement a the solution algorithm. The program has to contain a graphical visualization part. There, the prograss of the algorithm should be made visible. All important steps and decisions made by the program should be presented graphically.
Litteratur::
Computational Geometry, M. de Berg, M. van Kreveld, M. Overmars, O. Schwarzkopf, Springer Verlag, 2000, (secons edition)
