Про нас
Кафедри
Дистанційне навчання
Вступнику
Конференції
Наші партнери
Довідка
Підрозділи
Посилання
Програми

Computational Geometry II


This block course will take place Nov 3–7, 2014 in room 301. It is embedded in the regular course "Computational Geometry I" of Prof. Taras Banakh.

Lecturer


Prof. Alexander Wolff
Institute of Computer Science
University of Würzburg

 

Schedule

 

09:00-10:30 Lecture

10:30-12:00 Solving Exercises

12:00-12:30 Discussion of solutions

12:30-13:30 Lunch

13:30-15:00 Lecture

15:00-16:30 Solving Exercises

16:30-17:00 Discussion of solutions

 

Topics

 

  1. Solving Recurrences
    [slides, printer-friendly]
  2. Convex Hulls in 2D
    [slides, printer-friendly]
  3. Line Segment Intersection
    [slides, printer-friendly]
  4. Polygon Triangulation
    [slides, printer-friendly]
  5. Linear Programming
    [slides, printer-friendly]
  6. Orthogonal Range Searching
    [slides, printer-friendly]
  7. Point Location
    [slides, printer-friendly]
  8. Voronoi Diagrams
    [slides, printer-friendly]
  9. Delaunay Triangulations
    [slides, printer-friendly]
  10. Convex Hulls in 3D
    [slides, printer-friendly]
  11. Robot Motion Planning
    [slides, printer-friendly]

 

Textbook and Other Materials


The course will be based on the following textbook:
Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars: Computational Geometry: Algorithms and Applications, Springer, 3rd edition, 2008.


Exercises ("Übungen" in German) to each lecture can be found here.


Have some fun with the German language!