Publisher
Springer Nature Singapore
Reference7 articles.
1. Aggarwa, A., Guibas, L.J., Saxe, J., Shor, P.W.: A linear-time algorithm for computing the Voronoi diagram of a convex polygon. In: DCG, vol. 4, pp. 591–604 (1989)
2. Chan, T.M.: More planar two-center algorithms. Comput. Geom. Theory Appl. 13, 189–198 (1999)
3. Choi, J., Ahn, H.-K.: Efficient planar two-center algorithms. Comput. Geom. Theory Appl. 97, 101768:1-101768:10 (2021)
4. Choi, J., Jeong, D., Ahn, H.-K.: Covering convex polygons by two congruent disks. In: Flocchini, P., Moura, L. (eds.) IWOCA 2021. LNCS, vol. 12757, pp. 165–178. Springer, Heidelberg (2021). https://doi.org/10.1007/978-3-030-79987-8_12
5. Eppstein, D.: Faster construction of planar two-centers. In: Proceedings of the 8th ACM-SIAM Symposium on Discrete Algorithms, pp. 131–138 (1997)