Delaunay triangulation

(geometry, computer graphics) For a given set P of discrete points in a plane: a triangulation DT(P) such that no point in P is inside the circumcircle of any triangle in DT(P).