{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:13:52Z","timestamp":1764364432364,"version":"3.37.3"},"reference-count":18,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T00:00:00Z","timestamp":1573430400000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"name":"Ministry of Science and ICT","award":["IITP-2017-0-00905"],"award-info":[{"award-number":["IITP-2017-0-00905"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00453-019-00651-z","type":"journal-article","created":{"date-parts":[[2019,11,11]],"date-time":"2019-11-11T08:03:01Z","timestamp":1573459381000},"page":"1434-1473","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["The Geodesic Farthest-Point Voronoi Diagram in a Simple Polygon"],"prefix":"10.1007","volume":"82","author":[{"given":"Eunjin","family":"Oh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Barba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-1679","authenticated-orcid":false,"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,11]]},"reference":[{"issue":"6","key":"651_CR1","doi-asserted-by":"publisher","first-page":"591","DOI":"10.1007\/BF02187749","volume":"4","author":"A Aggarwal","year":"1989","unstructured":"Aggarwal, A., Guibas, L.J., Saxe, J., Shor, P.W.: A linear-time algorithm for computing the Voronoi diagram of a convex polygon. Discrete Comput. Geom. 4(6), 591\u2013604 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"651_CR2","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/s00454-016-9796-0","volume":"56","author":"H-K Ahn","year":"2016","unstructured":"Ahn, H.-K., Barba, L., Bose, P., 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\u2013859 (2016)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"651_CR3","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/BF02189321","volume":"9","author":"B Aronov","year":"1993","unstructured":"Aronov, B., Fortune, S., Wilfong, G.: The furthest-site geodesic Voronoi diagram. Discrete Comput. Geom. 9(3), 217\u2013255 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"651_CR4","unstructured":"Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. Technical Report SOCS-85.32, McGill University (1985)"},{"key":"651_CR5","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: A theorem on polygon cutting with applications. In: Proceedings of the 23rd Annual Symposium on Foundations of Computer Science (FOCS 1982), pp. 339\u2013349 (1982)","DOI":"10.1109\/SFCS.1982.58"},{"issue":"1","key":"651_CR6","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF01377183","volume":"12","author":"B Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Grigni, M., Guibas, L., Hershberger, J., Sharir, M., Snoeyink, J.: Ray shooting in polygons using geodesic triangulations. Algorithmica 12(1), 54\u201368 (1994)","journal-title":"Algorithmica"},{"issue":"1","key":"651_CR7","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(1), 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"2","key":"651_CR8","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"LJ Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci. 39(2), 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"6","key":"651_CR9","doi-asserted-by":"publisher","first-page":"1612","DOI":"10.1137\/S0097539793253577","volume":"26","author":"J Hershberger","year":"1997","unstructured":"Hershberger, J., Suri, S.: Matrix searching with the shortest-path metric. SIAM J. Comput. 26(6), 1612\u20131634 (1997)","journal-title":"SIAM J. Comput."},{"key":"651_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-52055-4","volume-title":"Concrete and Abstract Voronoi Diagrams","author":"R Klein","year":"1989","unstructured":"Klein, R.: Concrete and Abstract Voronoi Diagrams. Springer, Berlin (1989)"},{"key":"651_CR11","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1007\/3-540-58325-4_161","volume-title":"Algorithms and Computation","author":"Rolf Klein","year":"1994","unstructured":"Klein, R., Lingas, A.: Hamiltonian abstract Voronoi diagrams in linear time. In: Prooceedings of the 5th International Symposium on Algorithms and Computation (ISAAC 1994), pp. 11\u201319. Springer, Berlin (1994)"},{"key":"651_CR12","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Handbook of Computational Geometry, pp. 633\u2013701. Elsevier (2000)","DOI":"10.1016\/B978-044482537-7\/50016-4"},{"key":"651_CR13","unstructured":"Oh, E., Ahn, H.-K.: Voronoi diagrams for a moderate-sized point-set in a simple polygon. In: Proceedings of the 33rd International Symposium on Computational Geometry (SoCG 2017), vol. 77, pp. 52:1\u201352:15. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2017)"},{"key":"651_CR14","unstructured":"Oh, E., Barba, L., Ahn, H.-K.: The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon. In: Proceedings of the 32nd International Symposium on Computational Geometry (SoCG 2016), vol. 51, pp. 56:1\u201356:15. Schloss Dagstuhl\u2013Leibniz-Zentrum f\u00fcr Informatik (2016)"},{"issue":"6","key":"651_CR15","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1142\/S0218195999000315","volume":"9","author":"E Papadopoulou","year":"1999","unstructured":"Papadopoulou, E.: $$k$$-pairs non-crossing shortest paths in a simple polygon. Int. J. Comput. Geom. Appl. 9(6), 533\u2013552 (1999)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"6","key":"651_CR16","doi-asserted-by":"publisher","first-page":"611","DOI":"10.1007\/BF02187751","volume":"4","author":"R Pollack","year":"1989","unstructured":"Pollack, R., Sharir, M., Rote, G.: Computing the geodesic center of a simple polygon. Discrete Comput. Geom. 4(6), 611\u2013626 (1989)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"651_CR17","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1016\/0022-0000(89)90045-7","volume":"39","author":"S Suri","year":"1989","unstructured":"Suri, S.: Computing geodesic furthest neighbors in simple polygons. J. Comput. Syst. Sci. 39(2), 220\u2013235 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"651_CR18","unstructured":"Toussaint, G.T.: An optimal algorithm for computing the relative convex hull of a set of points in a polygon. In: Proceeding of EURASIP-86, Part 2, pp. 853\u2013856 (1986)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00651-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-019-00651-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-019-00651-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,10]],"date-time":"2020-11-10T00:13:14Z","timestamp":1604967194000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-019-00651-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,11,11]]},"references-count":18,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["651"],"URL":"https:\/\/doi.org\/10.1007\/s00453-019-00651-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"type":"print","value":"0178-4617"},{"type":"electronic","value":"1432-0541"}],"subject":[],"published":{"date-parts":[[2019,11,11]]},"assertion":[{"value":"11 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 November 2019","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"11 November 2019","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}