* computing the vertices (edges, etc) of a convex hull by linear programming
* Voronoi, Delaunay, duality, link with convex hull in dimension d+1 (sections 4.1, 4.2 and 4.3 of the book)
* First reconstruction algorithms: crust, cocone, flow complex, alpha-shape, alpha-complex
* backwards analysis of updates in 2D Delaunay, location of a point by walking or using a hierarchy of triangulations, incremental construction con BRIO
* robustness issues: IEEE numbers ("classroom examples of robustness problems in geometric computations"), exact arithmetic, filters