Delaunay Triangulations II

2.2. Delaunay/Voronoi duality:

Delaunay vs. convex hulls, Voronoi vs. hyperplanes arrangements, interpretation of empty sphere criterion.

2.3. Algorithms in 2D:

divide-and-conquer, incremental, efficient point location, predicates.

-- TD:

some nice application of 3D Delaunay (code provided): convex hull (over-kill)? $k$ nearest neighbors (repetitive)? Crust algorithm (too early)?