On Linear-Sized Farthest-Color Voronoi Diagrams
暂无分享，去创建一个
[1] Mark de Berg,et al. Realistic Input Models for Geometric Algorithms , 2002, Algorithmica.
[2] Sang Won Bae,et al. Best and worst-case coverage problems for arbitrary paths in wireless sensor networks , 2010, MASS.
[3] Sang Won Bae,et al. Exact Algorithms for the Bottleneck Steiner Tree Problem , 2011, Algorithmica.
[4] Rolf Klein,et al. The Farthest Color Voronoi Diagram and Related Problems , 2001 .
[5] Kurt Mehlhorn,et al. Furthest Site Abstract Voronoi Diagrams , 2001, Int. J. Comput. Geom. Appl..
[6] Micha Sharir,et al. The upper envelope of voronoi surfaces and its applications , 1993, Discret. Comput. Geom..
[7] Michael Ian Shamos,et al. Computational geometry: an introduction , 1985 .
[8] Herbert Edelsbrunner,et al. Interface surfaces for protein-protein complexes , 2004, RECOMB.
[9] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[10] Evanthia Papadopoulou,et al. The Hausdorff Voronoi Diagram of Point Clusters in the Plane , 2003, Algorithmica.
[11] D. T. Lee,et al. Two-Dimensional Voronoi Diagrams in the Lp-Metric , 1980, J. ACM.
[12] Sang Won Bae,et al. On exact solutions to the Euclidean bottleneck Steiner tree problem , 2010, Inf. Process. Lett..