The greedy triangulation of a nite planar point set is obtained by repeatedly inserting a shortest diagonal that doesn't intersect those already in the plane. We show that the problem of constructing the greedy triangulation of a nite set of points with integer coordinates in the plane is P-complete. This is the rst known geometric P-complete problem where the input is given as a set of points....