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

Regular Lectures

Every Monday (18:05–21:00) in room 372 at the Faculty of Mechanics and Mathematics.

Exam

????, ?? December 2017 at ??:00 in lecture room 372 at the Faculty of Mechanics and Mathematics.

 

 

In the Lecture Course we shall cover the following topics:

 

1. Convex hulls in 2D (Homework #1 )

2. Line Segment Intersections (Homework #2)

3. Doubly connected edge lists (Homework #3)

4. Polygon Triangulation (Homework #4)

5. Linear Programming (Homework #5)

6. Orthogonal Range Searching (Homework #6)

7. Point Location (Homework #7)

8. Voronoi Diagram (Homework #8)

9. Delaunay Triangulation

 

The lectures are based on the textbook:

Mark de Berg, Otfried Cheong, Marc van Kreveld, Mark Overmars: Computational Geometry: Algorithms and Applications, Springer, 3rd edition, 2008.

 

 

 

 

Results of Homeworks

 

No NameHW1HW2HW3HW4HW5HWExamSum
1

________________________________

 

 

 

Topics of block course Computational Geometry in 2014

 

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