====== Computational Geometry ======
([[..:start | home ]] |
[[..:lectures:start | lectures ]] |
[[..:labs:start| seminars]] |
presentations |
[[https://cw.felk.cvut.cz/forum/forum-1351.html|forum]] |
[[https://cw.felk.cvut.cz/upload/ | upload]] |
[[..:links:start|links]] )
====== Presentations ======
* [[https://cent.felk.cvut.cz/courses/VGE/presentations/ | Submitted presentations]] directory. Names of authors of uploaded presentations are in bold. Do not forget to upload the sources (ppt, tex,...).
* READ THE [[presentation_hints|Presentation hints]] before!
===== List of available topics =====
Thursday (12:45-14:15) - konkrétní data se ještě mohou změnit.
^ No. ^ Date ^ Student ^ Topic ^
| 1.| 26. 9. | xxxxxxxx | |
| 2.| 3.10. | xxxxxxxx | |
| 3.| 10.10. | | [1] 2D range tree construction and range tree search [PREPARATA 77-87, Mount (75-)79-81, Berg 99-120]. Focus on demonstration example or applet. Do not repeat Lecture 3. |
| 4.| 17.10. | Berka | [9a] Convex Hull of a simple polygon: algorithm of [[http://cgm.cs.mcgill.ca/%7Eathens/cs601/Lee.html | Lee]] [PREPARATA 166-171]|
| ::: | ::: | Koblížek | [9b] Convex Hull of a simple polygon: algorithm of [[http://softsurfer.com/Archive/algorithm_0203/algorithm_0203.htm | Melkman]] |
| 5.| 24.10. | Lučivňák | [6] Triangular method for planar search (Kirkpatrick's Planar point location) [PREPARATA 57-60, Mount 116-120].|
| ::: | ::: | Iegorova | [7] Overmars and van Leeuwen algorithm of dynamic convex hull. [PREPARATA 118-125]. Detailed example.|
| 6.| 31.10. | | |
| 7.| 7.11. | Kravec | [8] Beneath-beyond method (horní-dolní) [PREPARATA 131-140]. |
| ::: | ::: | Voráček | [11] Diameter of a point set. [PREPARATA 178-183]. |
| 8.| 14.11. | Bubeníček | [13] Largest empty circle [PREPARATA 248-254]|
| ::: | ::: | Gramovich | [12] Smallest enclosing circle. [PREPARATA 248-254] |
| 9.| 21.11. | | |
| 10.| 28.11. | Čajka | [21] Overlap of planar subdivisions. [Berg 33-40] |
| ::: | ::: | Pivoňka | [25] Algorithm for computation of the perimeter of a union of rectangles. [PREPARATA 340-347]|
| 11.| 5.12. | Shipachev | [18] D&C Algorithm of Delaunay triangulation: DeWall algorithm. [ {{:courses:cg:dewall.pdf|Cignoni}}, [[courses:cg:links:start#papers_-_local | Maur '02, 15-17]]].|
| ::: | ::: | Rózsa | [23] (2) Kernel of a Polygon [{{:courses:cg:presentations:p415-lee.pdf|Lee}}]|
| 12.| 12.12. | Moravenov | [14] k-th order Voronoi diagram. [PREPARATA 242-246]. |
| ::: | ::: | Holeček | [16] Algoritmy 3D Delaunayovy triangulace. [MAUR '02]. |
| 13.| 19.12. | | [37] Partition trees and a simplex method [Berg 335-343]|
| ::: | ::: | | [38] Cutting trees [Berg 346-353]|
| 14.| 9.1. | | |
/*
Task not chosen:
[1] 2D range tree construction and range tree search [PREPARATA 77-87, Mount (75-)79-81, Berg 99-120]. Focus on demonstration example or applet. Do not repeat Lecture 3.
[3] BSP trees in 2D and 3D [Mulmuley 372-382, Berg 249-263]
*/
[[..:start#literature|Literature]]
[Mulmuley] K. Mulmuley. Computational Geometry: An Introduction Through Randomized Algorithms. Prentice-Hall, New York, 1993
[Maur] Maur, P: {{ :courses:cg:presentations:maur-dt-3d.zip |Delaunay Triangulation in 3D.}} State of the Art and Concept of Doctoral Thesis, ZCU 2002