论文信息 - A fast algorithm for constructing Delaunay triangulations in the plane - 字舞流文

A fast algorithm for constructing Delaunay triangulations in the plane

[1] Robert J. Renka,et al. Algorithm 624: Triangulation and Interpolation at Arbitrarily Distributed Points in the Plane , 1984, TOMS.

[2] Scott W. Sloan,et al. An implementation of Watson's algorithm for computing 2-dimensional delaunay triangulations , 1984 .

[3] Scott W. Sloan,et al. Technical note: Efficient sorting routines in FORTRAN 77 , 1984 .

[4] Robert J. Renka,et al. A Storage-efficient Method for Construction of a Thiessen Triangulation , 1982 .

[5] Robin Sibson,et al. Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..

[6] C. Lawson. Software for C1 interpolation , 1977 .

[7] D. F. Watson. Computing the n-Dimensional Delaunay Tesselation with Application to Voronoi Polytopes , 1981, Comput. J..

[8] Adrian Bowyer,et al. Computing Dirichlet Tessellations , 1981, Comput. J..

[9] Robin Sibson,et al. Locally Equiangular Triangulations , 1978, Comput. J..