Minimum Width Color Spanning Annulus
暂无分享,去创建一个
[1] Sandip Das,et al. Smallest Color-Spanning Object Revisited , 2009, Int. J. Comput. Geom. Appl..
[2] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[3] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.
[4] Rolf Klein,et al. Smallest Color-Spanning Objects , 2001, ESA.
[5] Michael Ben-Or,et al. Lower bounds for algebraic computation trees , 1983, STOC.
[6] Horst W. Hamacher,et al. An optimal O(nlogn) algorithm for finding an enclosing planar rectilinear annulus of minimum width , 2009, Oper. Res. Lett..
[7] Rolf Klein,et al. The Farthest Color Voronoi Diagram and Related Problems , 2001 .
[8] Micha Sharir,et al. The upper envelope of voronoi surfaces and its applications , 1993, Discret. Comput. Geom..
[9] Danny Ziyi Chen,et al. Algorithms for interval structures with applications , 2011, Theor. Comput. Sci..