Another problem which is solved in 'one step' (if one assumes the existence of a Delaunay triangulation of a finite point set in the Euclidean plane as 'one step') is Thue's Theorem on optimal circle (disk) packing.

(I know that there was already an answer involving Delaunay triangulation, but I still wanted to mention this one).

Another problem which is solved in 'one step' (if one assumes proving the existence of a Delaunay triangulation of a finite point set in the Euclidean plane as 'one step') is Thue's Theorem on optimal circle (disk) packing.

(I know that there was already an answer involving Delaunay triangulation, but I still wanted to mention this one).