Warning
This page is located in archive. Go to the latest version of this course pages. Go the latest version of this page.

Computational Geometry

( home | lectures | seminars | presentations | forum | upload | links )

Presentations

List of available topics

Thursday (12:45-14:15)

No. Date Student Topic
1. 4.10. xxxxxxxx
2. 11.10. xxxxxxxx
3. 18.10. xxxxxxxx
4. 25.10. Pultar [9a] Convex Hull of a simple polygon: algorithm of Lee [PREPARATA 166-171]
Čáp [9b] Convex Hull of a simple polygon: algorithm of Melkman
5. 1.11. Vobecký [6] Triangular method for planar search (Kirkpatrick's Planar point location) [PREPARATA 57-60, Mount 116-120].
Haluza [7] Overmars and van Leeuwen algorithm of dynamic convex hull. [PREPARATA 118-125]. Detailed example.
6. 8.11.
7. 15.11. Tichá [8] Beneath-beyond method (horní-dolní) [PREPARATA 131-140].
Sedláček [11] Diameter of a point set. [PREPARATA 178-183].
8. 22.11. Tkáč [13] Largest empty circle [PREPARATA 248-254]
Čajka [12] Smallest enclosing circle. [PREPARATA 248-254]
9. 29.11.
10. 6.12. Hrakova [21] Overlap of planar subdivisions. [Berg 33-40]
Galajda [25] Algorithm for computation of the perimeter of a union of rectangles. [PREPARATA 340-347]
11. 13.12. Očenášek [18] D&C Algorithm of Delaunay triangulation: DeWall algorithm. [ Cignoni, Maur '02, 15-17].
Brachaczek [23] (2) Kernel of a Polygon [Lee]
12. 20.12. Novák [37] Partition trees and a simplex method [Berg 335-343]
Šilhavý [38] Cutting trees [Berg 346-353]
13. 3.1. Vomastek [14] k-th order Voronoi diagram. [PREPARATA 242-246].
Petrov [16] Algoritmy 3D Delaunayovy triangulace. [MAUR '02].
14. 10.1.

Task not chosen: Glomot

Literature

[Mulmuley] K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice Hall, New York, 1993

[Maur] Maur, P: Delaunay Triangulation in 3D. State of the Art and Concept of Doctoral Thesis, ZCU 2002

courses/cg/presentations/start.txt · Last modified: 2018/11/15 11:12 by felkepet