Author:
Evans William,Lin Rebecca
Publisher
Springer International Publishing
Reference16 articles.
1. Ahn, H.K., Barba, L., Bose, P., De Carufel, J.L., Korman, M., Oh, E.: A linear-time algorithm for the geodesic center of a simple polygon. Discrete Comput. Geom. 56(4), 836–859 (2016)
2. Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. In: Johnson, D.S., Nishizeki, T., Nozaki, A., Wilf, H.S. (eds.) Discrete Algorithms and Complexity, pp. 65–79. Academic Press (1987)
3. Berg, M.D., Cheong, O., Kreveld, M.V., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008). https://doi.org/10.1007/978-3-540-77974-2
4. Du, H., Xu, Y.: An approximation algorithm for $$k$$-center problem on a convex polygon. J. Combin. Optim. 27(3), 504–518 (2014)
5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)