An implementation of Watson's algorithm for computing 2-dimensional delaunay triangulations

A FORTRAN 77 implementation of Watson's algorithm for computing two-dimensional Delaunay triangulations is described. The algorithm is shown to have an asymptotic time complexity bound which is better than O(N1.5) by applying it to collections of N points generated randomly within the unit square. The computer code obeys strict FORTRAN 77 syntax. Excluding the memory needed to store the co-ordinates of the points, it requires slightly greater than 9N integer words of memory to assemble and store the Delaunay triangulation. © 1984