Covering point sets with two convex objects
暂无分享,去创建一个
[1] Shigeo Abe DrEng. Pattern Classification , 2001, Springer London.
[2] Ying Liu,et al. Planar case of the maximum box and related problems , 2003, CCCG.
[3] Bernard Chazelle,et al. On a circle placement problem , 1986, Computing.
[4] Michael Segal. Planar Maximum Box Problem , 2004, J. Math. Model. Algorithms.
[5] D. T. Lee,et al. Geometric complexity of some location problems , 1986, Algorithmica.
[6] Boris Aronov,et al. On approximating the depth and related problems , 2005, SODA '05.
[7] Z. Drezner. Note-On a Modified One-Center Model , 1981 .
[8] David G. Stork,et al. Pattern Classification , 1973 .
[9] Thomas Ottmann,et al. Algorithms for Reporting and Counting Geometric Intersections , 1979, IEEE Transactions on Computers.
[10] Michael Segal,et al. Improved algorithms for placing undesirable facilities , 2002, CCCG.
[11] Mark de Berg,et al. Computational geometry: algorithms and applications , 1997 .
[12] Micha Sharir,et al. Davenport-Schinzel sequences and their geometric applications , 1995, Handbook of Computational Geometry.