Interpolation of data on the surface of a sphere
ACM Transactions on Mathematical Software (TOMS)
Computational geometry: an introduction
Computational geometry: an introduction
A fast algorithm for constructing Delaunay triangulations in the plane
Advances in Engineering Software
Primitives for the manipulation of general subdivisions and the computation of Voronoi
ACM Transactions on Graphics (TOG)
ACM Transactions on Mathematical Software (TOMS)
Optimal Expected-Time Algorithms for Closest Point Problems
ACM Transactions on Mathematical Software (TOMS)
Algorithms + Data Structures = Programs
Algorithms + Data Structures = Programs
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
Automatic extraction of Irregular Network digital terrain models
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
| Hi-index | 0.01 |
A new, dynamic, hierarchical subdivision and recursive algorithm for computing Delaunay triangulations is presented. The algorithm has four main steps: (1) location of the already formed triangle that contains the point (2) identification of other adjoining triangles whose circumcircle contains the point (3) formation of the new triangles, and (4) database update. Different search procedures are analyzed. It is shown that the “oriented walk” search, when the total number of points is less than 417 or when the points are presorted by distance or coordinates. The algorithm has point-deletion capabilities which are discussed in detail.