Geometric Algorithms

Vorlesung: Montags, 9:45 - 11:15 , IZ 305
Uebung: Mittwochs, 13:15 - 14:45, alle 2 Wochen, IZ 305
Uebungen werden gehalten am: 25. April, 9/23 Mai (1 Stunde Midterm am 23. ), 6/20. Juni, 4/18 Juli

Grundkenntnisse in geometrischen Algorithmen und einfachen Datenstrukturen sind vorteilhaft.

Studienleisung: 50 % der Punkte auf das "Midterm Exam" im Mai sowie Vorrechnen einer Hausuebung in den Uebungen

point location

robot motion planning

shortest paths in environments in the plane

"Computational Geometry - Algorithms and Applications" by M. de Berg, O. Cheong, M. van Kreveld, M. Overmars (Chapters 6, 8, 13, 15)

"Discrete and Computational Geometry" by S. L. Devadoss, J. O'Rourke (Chapter 5)

"Computing Minimum Length Paths of a Given Homotopy Class" by J. Hershberger, J. Snoeyink in CGTA 4 (1994), pp. 63-97

"A Novel Type of Skeleton for Polygons" by O. Aichholzer, F. Aurenhammer, D. Alberts, B. Gaertner in J. of Univ. Comp. Science 1:12 (1995), pp. 752-761

"The Crust and the Beta-Skeleton: combinatorial Curve Reconstruction" by N. Amenta, M. Bern, D. Eppstein in Graphical Models and Image Processing, 60/2:2 (1998), pp 125-135

other relevant scientific papers as needed

Announcements and Dates

NEU: (9. July 2012) Hausaufgabenzettel