The Expected Extremes in a Delaunay Triangulation
暂无分享,去创建一个
[1] A. Rényi,et al. über die konvexe Hülle von n zufällig gewählten Punkten , 1963 .
[2] Gaston H. Gonnet,et al. Expected Length of the Longest Probe Sequence in Hash Code Searching , 1981, JACM.
[3] David P. Dobkin,et al. Delaunay graphs are almost as good as complete graphs , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[4] R. E. Miles. On the homogeneous planar Poisson point process , 1970 .
[5] David M. Mount,et al. Globally-Equiangular triangulations of co-circular points in 0(n log n) time , 1988, SCG '88.
[6] Robin Sibson,et al. Locally Equiangular Triangulations , 1978, Comput. J..
[7] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[8] Luc Devroye,et al. The Expected Length of the Longest Probe Sequence for Bucket Searching when the Distribution is Not Uniform , 1985, J. Algorithms.
[9] Rex A. Dwyer. Higher-dimensional voronoi diagrams in linear expected time , 1989, SCG '89.