Sorting helps for voronoi diagrams
暂无分享,去创建一个
[1] D. T. Lee,et al. Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.
[2] Robert L. Scot Drysdale,et al. Voronoi diagrams based on convex distance functions , 1985, SCG '85.
[3] Chak-Kuen Wong,et al. Voronoi Diagrams in L1 (Linfty) Metrics with 2-Dimensional Storage Applications , 1980, SIAM J. Comput..
[4] Baruch Schieber,et al. Fast geometric approximation techniques and geometric embedding problems , 1989, SCG '89.
[5] Andrew Chi-Chih Yao. Lower bounds for algebraic computation trees with integer inputs , 1989, 30th Annual Symposium on Foundations of Computer Science.
[6] Steven Fortune,et al. A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.
[7] Franz Aurenhammer,et al. Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.
[8] Donald B. Johnson,et al. A priority queue in which initialization and queue operations takeO(loglogD) time , 1981, Mathematical systems theory.
[9] Paul Chew,et al. There are Planar Graphs Almost as Good as the Complete Graph , 1989, J. Comput. Syst. Sci..
[10] R. Seidel. A Method for Proving Lower Bounds for Certain Geometric Problems , 1984 .
[11] Peter van Emde Boas,et al. Design and implementation of an efficient priority queue , 1976, Mathematical systems theory.
[12] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.
[13] Robert E. Tarjan,et al. Finding Minimum Spanning Trees , 1976, SIAM J. Comput..
[14] Steven Fortune. A Fast Algorithm for Polygon Containment by Translation (Extended Abstract) , 1985, ICALP.