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 squa...
| Main Authors: | , |
|---|---|
| Format: | Journal article |
| Language: | English |
| Published: |
1984
|