====== List of presentation topics with source materials ======


=== [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.
  * 
 === [6]   Triangular method for planar search (Kirkpatrick's Planar point location)  === 
  * [PREPARATA 57-60, Mount 116-120].
  * 
 === [7]   Overmars and van Leeuwen algorithm of dynamic convex hull.  ===   
  * [PREPARATA 118-125]. Detailed example.
  * 
 === [8]   Beneath-beyond method (horní-dolní)  ===
  * [PREPARATA 131-140].  
  * 
 === [9a]  Convex Hull of a simple polygon: algorithm of Lee    === 
  * [[http://cgm.cs.mcgill.ca/%7Eathens/cs601/Lee.html | Lee]] 
  * [PREPARATA 166-171]
  * 
 === [9b]  Convex Hull of a simple polygon: algorithm of Melkman  ===
  * [[http://softsurfer.com/Archive/algorithm_0203/algorithm_0203.htm | Melkman]]  
  * 
 === [11]  Diameter of a point set.  === 
  * [PREPARATA 178-183]. 
  * 
 === [12]  Smallest enclosing circle.  === 
  * [PREPARATA 248-254]. 
  * 
 === [13]  Largest empty circle  === 
  * [PREPARATA 248-254]
  * 
 === [14]  k-th order Voronoi diagram.  === 
  * [PREPARATA 242-246]. 
  * 
 === [18]  D&C Algorithm of Delaunay triangulation: DeWall algorithm. ===
  *  [ [[misc:projects:oppa_oi_english:courses:ae4m39vg:links:start#papers_-_local | Maur '02, 15-17 ]] ].
  * 
 === [23]  Detection of the plane polygon kernel  === 
  * [PREPARATA 291-298].
  * 
 === [25]  Algorithm for computation of the perimeter of a union of rectangles.  === 
  * [PREPARATA 340-347]
  * 
 === [26]  Intersection of rectangles  === 
  * [PREPARATA 351-357].
  * 
 === [36]  Robot motion planning ===
  * [Berg 283-290]   
  * 
 === [37]  Partition trees and a simplex method ===
  * [Berg 335-343]
  * 
 === [38]  Cutting trees ===
  * [Berg 346-353]
  * 
 === [39]  Kinetic data structures - introduction ===
  *