Finding Tailored Partitions
暂无分享,去创建一个
[1] Nimrod Megiddo,et al. On the Complexity of Some Common Geometric Location Problems , 1984, SIAM J. Comput..
[2] Z. Drezner. On the rectangular p‐center problem , 1987 .
[3] David Avis,et al. Diameter partitioning , 1986, Discret. Comput. Geom..
[4] David G. Kirkpatrick,et al. On the shape of a set of points in the plane , 1983, IEEE Trans. Inf. Theory.
[5] Tetsuo Asano,et al. Clustering algorithms based on minimum and maximum spanning trees , 1988, SCG '88.
[6] F. P. Preparata,et al. Convex hulls of finite sets of points in two and three dimensions , 1977, CACM.
[7] David S. Johnson,et al. Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .
[8] Herbert Edelsbrunner,et al. Algorithms in Combinatorial Geometry , 1987, EATCS Monographs in Theoretical Computer Science.
[9] Bernard Chazelle,et al. On the convex layers of a planar set , 1985, IEEE Trans. Inf. Theory.
[10] Franco P. Preparata,et al. An optimal real-time algorithm for planar convex hulls , 1979, CACM.
[11] Bernard Chazelle,et al. The power of geometric duality , 1985, BIT Comput. Sci. Sect..
[12] Jan van Leeuwen,et al. Maintenance of Configurations in the Plane , 1981, J. Comput. Syst. Sci..