Optimality of the Delaunay triangulation in ℝd
暂无分享,去创建一个
[1] V. T. Rajan,et al. Optimality of the Delaunay triangulation in Rd , 1991, SCG '91.
[2] David Eppstein,et al. MESH GENERATION AND OPTIMAL TRIANGULATION , 1992 .
[3] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[4] R. B. Simpson,et al. On optimal interpolation triangle incidences , 1989 .
[5] Kevin Q. Brown,et al. Voronoi Diagrams from Convex Hulls , 1979, Inf. Process. Lett..
[6] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[7] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[8] Raimund Seidel,et al. Voronoi diagrams and arrangements , 1986, Discret. Comput. Geom..
[9] Leonidas J. Guibas,et al. Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams , 1983, STOC.
[10] L. Nackman,et al. Automatic mesh generation using the symmetric axis transformation of polygonal domains , 1992, Proc. IEEE.
[11] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).
[12] R. Cottle. Symmetric dual quadratic programs , 1963 .