{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:32:56Z","timestamp":1760441576748,"version":"3.37.3"},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T00:00:00Z","timestamp":1560729600000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["2018R1D1A1B07042755"],"award-info":[{"award-number":["2018R1D1A1B07042755"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","award":["2015R1D1A1A01057220"],"award-info":[{"award-number":["2015R1D1A1A01057220"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2019,12]]},"DOI":"10.1007\/s00454-019-00110-0","type":"journal-article","created":{"date-parts":[[2019,6,17]],"date-time":"2019-06-17T17:02:43Z","timestamp":1560790963000},"page":"743-774","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["$$L_1$$ Geodesic Farthest Neighbors in a Simple Polygon and Related Problems"],"prefix":"10.1007","volume":"62","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8802-4247","authenticated-orcid":false,"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,6,17]]},"reference":[{"issue":"4","key":"110_CR1","doi-asserted-by":"publisher","first-page":"836","DOI":"10.1007\/s00454-016-9796-0","volume":"56","author":"HK Ahn","year":"2016","unstructured":"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\u2013859 (2016)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"110_CR2","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 Vorono\u012d diagram. Discrete Comput. Geom. 9(3), 217\u2013255 (1993)","journal-title":"Discrete Comput. Geom."},{"issue":"6","key":"110_CR3","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1016\/j.comgeo.2015.02.005","volume":"48","author":"SW Bae","year":"2015","unstructured":"Bae, S.W., Korman, M., Okamoto, Y., Wang, H.: Computing the $L_1$ geodesic diameter and center of a simple polygon in linear time. Comput. Geom. 48(6), 495\u2013505 (2015)","journal-title":"Comput. Geom."},{"key":"110_CR4","unstructured":"Barba, L.: Optimal algorithm for geodesic farthest-point Voronoi diagrams. In: Proceedings of the 35th Symposium on Computational Geometry (SoCG 2019). LIPIcs (2019)"},{"issue":"3","key":"110_CR5","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0925-7721(99)00019-X","volume":"13","author":"TM Chan","year":"1999","unstructured":"Chan, T.M.: More planar two-center algorithms. Comput. Geom. 13(3), 189\u2013198 (1999)","journal-title":"Comput. Geom."},{"issue":"2","key":"110_CR6","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1002\/1520-6750(198704)34:2<229::AID-NAV3220340207>3.0.CO;2-1","volume":"34","author":"Z Drezner","year":"1987","unstructured":"Drezner, Z.: On the rectangular $p$-center problem. Nav. Res. Logist. 34(2), 229\u2013234 (1987)","journal-title":"Nav. Res. Logist."},{"issue":"2","key":"110_CR7","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":"2","key":"110_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"LJ Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(2), 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"2","key":"110_CR9","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/0925-7721(94)90010-8","volume":"4","author":"J Hershberger","year":"1994","unstructured":"Hershberger, J., Snoeyink, J.: Computing minimum length paths of a given homotopy class. Comput. Geom. 4(2), 63\u201397 (1994)","journal-title":"Comput. Geom."},{"issue":"6","key":"110_CR10","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."},{"issue":"4","key":"110_CR11","doi-asserted-by":"publisher","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Linear-time algorithms for linear programming in ${ R}^3$ and related problems. SIAM J. Comput. 12(4), 759\u2013776 (1983)","journal-title":"SIAM J. Comput."},{"key":"110_CR12","unstructured":"Oh, E., Barba, L., Ahn, H.K.: The farthest-point geodesic Voronoi diagram of points on the boundary of a simple polygon. In: Fekete, S., Lubiw, A. (eds.). Proceedings of the 32nd Symposium on Computational Geometry (SoCG 2016), vol. 51, pp. 56:1\u201356:15. LIPIcs, Leibniz International Proceedings in Informatics, Schloss Dagstuhl. Leibniz-Zentrum f\u00fcr Informatik, Wadern (2016)"},{"key":"110_CR13","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/j.comgeo.2019.05.001","volume":"82","author":"E Oh","year":"2019","unstructured":"Oh, E., Bae, S.W., Ahn, H.-K.: Computing a geodesic two-center of points in a simple polygon. Comput. Geom. 82, 45\u201359 (2019)","journal-title":"Comput. Geom."},{"key":"110_CR14","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/j.comgeo.2018.02.008","volume":"74","author":"E Oh","year":"2018","unstructured":"Oh, E., De Carufel, J.L., Ahn, H.K.: The 2-center problem in a simple polygon. Comput. Geom. 74, 21\u201337 (2018)","journal-title":"Comput. Geom."},{"key":"110_CR15","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction. Texts and Monographs in Computer Science.","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Texts and Monographs in Computer Science. Springer, New York (1985)"},{"key":"110_CR16","first-page":"9","volume":"3","author":"GT Toussaint","year":"1989","unstructured":"Toussaint, G.T.: Computing geodesic properties inside a simple polygon. Revue D\u2019Intelligence Artificielle 3, 9\u201342 (1989)","journal-title":"Revue D\u2019Intelligence Artificielle"}],"container-title":["Discrete &amp; Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00110-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-019-00110-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-019-00110-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,15]],"date-time":"2020-06-15T23:23:43Z","timestamp":1592263423000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-019-00110-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,17]]},"references-count":16,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2019,12]]}},"alternative-id":["110"],"URL":"https:\/\/doi.org\/10.1007\/s00454-019-00110-0","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2019,6,17]]},"assertion":[{"value":"16 September 2017","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"19 May 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"6 June 2019","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 June 2019","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}