List of presentation topics with source materials

[1] 2D range tree construction and range tree search

[6] Triangular method for planar search (Kirkpatrick's Planar point location)

[7] Overmars and van Leeuwen algorithm of dynamic convex hull.

[8] Beneath-beyond method (horní-dolní)

[9a] Convex Hull of a simple polygon: algorithm of Lee

[9b] Convex Hull of a simple polygon: algorithm of Melkman

[11] Diameter of a point set.

[12] Smallest enclosing circle.

[13] Largest empty circle

[14] k-th order Voronoi diagram.

[18] D&C Algorithm of Delaunay triangulation: DeWall algorithm.

[23] Detection of the plane polygon kernel

[25] Algorithm for computation of the perimeter of a union of rectangles.

[26] Intersection of rectangles

[36] Robot motion planning

[37] Partition trees and a simplex method

[38] Cutting trees

[39] Kinetic data structures - introduction