Computing the geodesic centers of a polygonal domain☆
Under an Elsevier user license
open archive
Keywords
Polygonal domain
Shortest path
Geodesic center
Exact algorithm
Cited by (0)
- ☆
A preliminary version of this paper was presented at the 26th Canadian Conference on Computational Geometry (CCCG'14) [4]. Work by S.W. Bae was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Science, ICT & Future Planning (2013R1A1A1A05006927). Work by M. Korman was partially supported by the ELC project (MEXT KAKENHI No. 24106008). Work by Y. Okamoto was partially supported by Grant-in-Aid for Scientific Research from Ministry of Education, Science and Culture, Japan and Japan Society for the Promotion of Science, and the ELC project (Grant-in-Aid for Scientific Research on Innovative Areas, MEXT Japan).
© 2015 Elsevier B.V.