We'll see a small zoo of algorithms for the following problem: given a bunch of points in the plane, find the placement of a new point, so that the smallest angle in the Delaunay triangulation of the combined point set is as big as possible.