References
- P.K. Agarwal and M. Sharir, Efficient algorithms for geometric optimization, ACM Computing Surveys, vol. 30, pp. 412-458, 1998 https://doi.org/10.1145/299917.299918
- R. Cole, Slowing down sorting networks to obtain faster sorting algorithms, Journal of ACM, 34, pp. 200-208, 1987 https://doi.org/10.1145/7531.7537
- J. Friedman, J. Hershberger, and J. Snoeyink, Efficiently planning compliant motion in the plane, SIAM Journal on Computing, vol. 25, no. 3, pp. 562-599, 1996 https://doi.org/10.1137/S0097539794263191
- N. Megiddo, Applying parallel computing algorithms in the design of serial algorithms, Journal of ACM, vol. 30, pp. 852-865, 1983 https://doi.org/10.1145/2157.322410
- M. H. Overmars and J. van Leeuwen, Maintenance of configurations in the plane, Journal of Computer and System Science, vol. 23, pp. 166-204, 1981 https://doi.org/10.1016/0022-0000(81)90012-X
- F.P. Preparata and M.I. Shamos, Computational Geometry: an Introduction, Springer-Verlag, New York, 1985
- P.K. Agarwal, M. Sharir and E. Welzl, The discrete 2-center problem, Proceedings of 13th Annual Symposium on Computational Geometry, pp. 147-155, 1997 https://doi.org/10.1145/262839.262921
- D. Eppstein, Faster construction of planar two-centers, Proceedings of 8th ACM-SIAM Symposium on Discrete Algorithms, pp. 131-138, 1997
-
J.W. Jaromczyk and M. Kowaluk, Orientation independent covering of points in
$R^2$ with pairs of rectangles, Lecture Notes in Computer Science, vol. 871, pp. 71-78, 1996 - M.J. Katz, K. Kedem, and M. Segal, Discrete rectilinear 2-center problems, Computational Geometry, vol. 15, pp. 203-214, 2000 https://doi.org/10.1016/S0925-7721(99)00052-8
- M. Sharir, A near-linear algorithm for the planar 2-center problem, Proceedings of 12th Annual ACM Symposium on Computational Geometry, pp. 106-112, 1996 https://doi.org/10.1145/237218.237251