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

Regular Lectures

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

Exam

????, ?? December 2016 at ??:00 in lecture room 379 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 Ahoshton Diana38'10930'
2Artyshko Anastasia38'98'28''
3Bandura Yulia48'10729'
4Bereza Hrystyna98'148'645''
5 Bihun Roman15142416877
6 Didokha Zoreslava108'128'644''
7Dmytryshyn Marianna48'81232'
8Hryadil Nikoletta48'10830'
9Husar Yulia38'88'27''
10Kazanivskyi Mykhailo28'108'28''
11Kosaniak Marian38'8'19''
12Kopytko Nadia108'108'36''
13Kotsovska Olha88'128'645''
14Kuzyk Oksana691216649
15Kuz' Iryna1614241678
16Melaniuk Roman34108'25'
17Mokrytskyi Taras1151430
18Oleskevych Olha13131816565
19Perun Ivan99
20Perun Vasyl99
21Protsiv Ilona56121437
22Romanovych Halyna108'108'36''
23Samborska Olia48'88'28''
24Semen Daryna88'98'33''
25Stelmakh Yaryna147101344
26Syrotyn Nataliya68'148'743''
27Sus Olia47'7'725''
28Tatarchuk Valentyna48'921'
29Teliuk Uliana48'81232'
30Tymchyshak Maria48'3924'
31Wenhlowska Natalia05914

________________________________

 

 

 

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.