{{page>../menu&nofooter&noeditbutton}}

====== Presentations ======
  * [[https://cent.felk.cvut.cz/courses/VGE/presentations/ | Submitted presentations]] directory. Names of authors of uploaded presentations are in bold. <fc #FF0000>Do not forget to upload the sources (ppt, tex,...) to brute.</fc>
  * READ THE [[presentation_hints|Presentation hints]] before!

/* ===== List of available topics ===== */
===== Presentation dates and students registered for them =====

[[https://docs.google.com/spreadsheets/d/1PxCjXzib4dYWLdp43SfItUuc5S4x5EL3_QOw7o9YO94/edit?usp=sharing | Thursday (11:00-12:30)]]
the specific date may change.


/*   * [[https://docs.google.com/spreadsheets/d/1FaFGOcX3q8MyZzQ-ILAtZcaHnmU7Ex-Df-kPcxAmAPI/edit#gid=0 | Thursday (9.15-10.45)]]  */
/*  * [[https://docs.google.com/spreadsheets/d/1RDvsXKuvYMLmbuFO0z2nfFOv0DWq7b6SYW5gDRjog8E/edit#gid=0 | Thursday (11:00-12:30)]]  */

/*
<fc #ff0000>Choose a topic and fill your name into this [[https://docs.google.com/spreadsheets/d/1PjS5Tha7LnicwUayXJompZqgYqz_iwo08bV0Su3EHrs/edit?usp=sharing | Google sheet]] </fc>. 
  * If more people want the same topic, try to choose one peacefully
  * Choose topic in week three asap - time is running and you have to have time for preparation

*/

/*
^ 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 a demonstration example or an applet. Do not repeat Lecture 3.|
| ::: | :::    | | <fc #ff0000>[44] Halfedge data structure in [[https://www.graphics.rwth-aachen.de/software/openmesh/intro/ | OpenMesh]] library. Demo of ovelap of planar subdivisions. </fc>|
|   4.| 17.10. | | [21] Overlap of planar subdivisions. [Berg 33-39]  | 
| ::: | :::    | | [6] Triangular method for planar search (Kirkpatrick's Planar point location) [PREPARATA 57-60, Mount 116-120]. |
|   5.| 24.10. | | [9a] Convex Hull of a simple polygon: algorithm of [[http://cgm.cs.mcgill.ca/%7Eathens/cs601/Lee.html | Lee]]] [PREPARATA 166-171]| 
| ::: | :::    | | [9b] Convex Hull of a simple polygon: algorithm of [[http://cgm.cs.mcgill.ca/~athens/cs601/Melkman.html | Melkman]] [PREPARATA 166-171]| 
|   6.| 31.10. | | [7] Overmars and van Leeuwen algorithm of dynamic convex hull. [PREPARATA 118-125]. Detailed example. | 
| ::: | :::    | | [8] Beneath-beyond method (horní-dolní) [PREPARATA 131-140].| 
|   7.|  7.11. | | [11] Diameter of a point set. [PREPARATA 178-183]. |
| ::: | :::    | | [23] Kernel of a Polygon [{{:courses:cg:presentations:p415-lee.pdf|Lee}}]| 
|   8.| 14.11. | | [13] Largest empty circle [PREPARATA 248-254]  | 
| ::: | :::    | | [12] Smallest enclosing circle. [Berg 86-89, Mount20 135-140, PREPARATA 248-254] [[https://colab.research.google.com/drive/17jivLkHEQdTIxVccEe8w5MKfaDC6NK_u?usp=sharing#scrollTo=Jvk9FeNG-F3R |Impementace]]| 
|   9.| 21.11. | | [14] k-th order Voronoi diagram. [PREPARATA 242-246]. | 
| ::: | :::    | | [44] Variants of Voronoi diagram - different metrics, weights, and site shapes [[http://www.nirarebakun.com/voro/efpvorocli.html | applets]] (use appletviewer from [[https://www.oracle.com/java/technologies/java-archive-javase10-downloads.html | jdk 10]])| 
|  10.| 28.11. | | [18] D&C Algorithm of Delaunay triangulation: DeWall algorithm. [ {{:courses:cg:dewall.pdf|Cignoni}}, [[courses:cg:links:start#papers_-_local | Maur '02, 15-17]]].  | 
| ::: | :::    | ---  | [43] Quad edge data structure and its usage for storage of DT and VD.[Rourke 147-149,199, [[http://www.sccg.sk/~samuelcik/dgs/quad_edge.pdf | Guibas&Stolfi]]], [[http://www.neolithicsphere.com/geodesica/doc/quad_edge_overview.htm | Overview]]|
|  11.|  5.12. | | [25] Algorithm for computation of the perimeter of a union of rectangles. [PREPARATA 340-347] |
| ::: | :::    |   |  |
|  12.|  12.12. | | [35] Intersection of convex polygons. [O'Rourke 242-252] |
| ::: | :::    | | [22] Minimum spanning tree in Eucledian space. |
|  13.| 19.12. | | [37] Partition trees and a simplex method [Berg 335-343] | 
| ::: | :::    | | [38] Cutting trees [Berg 346-353]| 
|  14.|  9.1.  | | [39] Kinetic data structures - introduction - kinetic convex hull {{ :courses:cg:presentations:rs-kchmu-03.pdf |Razzazi}}  |
| ::: | :::    | | [36] Robot motion planning [Berg 283-290]| 



[36] Robot motion planning [Berg 283-290]

|  12.|  8.12. | --- | | 
| ::: | :::    | --- | [24] Incremental linear programming [BERG (63-)71-79]| 
| ::: | :::    |   | [26] Algorithm for computation of the intersection of rectangles. [PREPARATA 351-357] |

| ::: | :::    |   | | 
|  14.|  6.1.  | ---       | Předtermín, pokud bude zájem  | 

[16] Algoritmy 3D Delaunayovy triangulace.  [MAUR '02]. 
Task not chosen: 

<del>[3]  BSP trees in 2D and 3D [Mulmuley 372-382, Berg 249-263]</del>

*/


===== Literature =====

[Berg, Mount, O'Rourke, Preparata] viz [[..:start#literature|úvodní stránka]]

[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