There is also a trick (read: algorithm) in computational geometry that computes (2D) Delaunay triangulation by mapping the points onto a (3D) paraboloid, and th

There is also a trick (read: algorithm) in computational geometry that computes (2D) Delaunay triangulation by mapping the points onto a (3D) paraboloid, and then computing the convex hull of that. E.g.: http://i.stack.imgur.com/OuWmZ.png http://i.stack.imgur.com/OuWmZ.png