The Least Diagonal Network (Fraser and van den Driessche 1972) is a triangulation scheme very similar to the Delaunay Tessellation; in practice, most of the connections are identical (Dale 1999; Upton and Fingleton 1985). In this scheme, connections are added one-by-one to the network, from shortest to longest, as long as a new connection does not intersect any previously added connection. Unlike the others, this connection scheme is limited to two dimensions.
Example of a least diagonal network.