: This note proposes a simple rule to determine a unique triangulation among all Delaunay triangulations of a planar point set, based on two preferred directions. We show that the triangulation can be generated by extending Lawson's edge-swapping algorithm and that point deletion is a local procedure. The rule can be implemented exactly when the points have integer coordinates and can be used to improve image compression methods. Key words: Delaunay triangulation, uniqueness, edge-swapping, integer arithmetic.
Christopher Dyken, Michael S. Floater