Planar geometric location problems and maintaining the width of a planar set
作者： Pankaj K. Agarwal , Micha Sharir
关键词:
摘要:
acm.org
sci-hub.st 参考文章(23)
Toshihide Ibaraki, Shigeru Masuyama, Toshiharu Hasegawa, The Computational Complexity of the m -Center Problems on the Plane IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences. pp. 57- 64 ,(1981)
Robert Endre Tarjan, Data Structures and Network Algorithms ,(1983)
Kurt Mehlhorn, Data Structures and Algorithms 3 : Multi-dimensional Searching and Computational Geometry ,(2012)
J. Hershberger, S. Suri, Finding tailored partitions symposium on computational geometry. pp. 255- 265 ,(1989) , 10.1145/73833.73862
D. T. Lee, Y. F. Wu, Geometric complexity of some location problems Algorithmica. ,vol. 1, pp. 193- 211 ,(1986) , 10.1007/BF01840442
Pankaj K. Agarwal, Boris Aronov, Micha Sharir, Subhash Suri, Selecting distances in the plane symposium on computational geometry. pp. 321- 331 ,(1990) , 10.1145/98524.98597
Michael I. Shamos, Franco P. Preparata, Computational Geometry: An Introduction ,(1978)
Richard Cole, Slowing down sorting networks to obtain faster sorting algorithms Journal of the ACM. ,vol. 34, pp. 200- 208 ,(1987) , 10.1145/7531.7537
Robert J. Fowler, Michael S. Paterson, Steven L. Tanimoto, Optimal packing and covering in the plane are NP-complete☆ Information Processing Letters. ,vol. 12, pp. 133- 137 ,(1981) , 10.1016/0020-0190(81)90111-3
Herbert Edelsbrunner, Mark H Overmars, Batched dynamic solutions to decomposable searching problems Journal of Algorithms. ,vol. 6, pp. 515- 542 ,(1985) , 10.1016/0196-6774(85)90030-6