{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,28]],"date-time":"2025-11-28T21:10:32Z","timestamp":1764364232908,"version":"3.37.3"},"reference-count":28,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T00:00:00Z","timestamp":1468195200000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea (KR)","doi-asserted-by":"publisher","award":["2011-0030044"],"award-info":[{"award-number":["2011-0030044"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006321","name":"National Institutes of Natural Sciences (JP)","doi-asserted-by":"publisher","award":["24106008"],"award-info":[{"award-number":["24106008"]}],"id":[{"id":"10.13039\/501100006321","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":[[2016,12]]},"DOI":"10.1007\/s00454-016-9796-0","type":"journal-article","created":{"date-parts":[[2016,7,11]],"date-time":"2016-07-11T09:54:10Z","timestamp":1468230850000},"page":"836-859","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":15,"title":["A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon"],"prefix":"10.1007","volume":"56","author":[{"given":"Hee-Kap","family":"Ahn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luis","family":"Barba","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prosenjit","family":"Bose","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Lou","family":"De Carufel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eunjin","family":"Oh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,7,11]]},"reference":[{"issue":"1\u20134","key":"9796_CR1","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01553882","volume":"4","author":"B Aronov","year":"1989","unstructured":"Aronov, B.: On the geodesic Voronoi diagram of point sites in a simple polygon. Algorithmica 4(1\u20134), 109\u2013140 (1989)","journal-title":"Algorithmica"},{"issue":"1","key":"9796_CR2","doi-asserted-by":"crossref","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(1), 217\u2013255 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"9796_CR3","unstructured":"Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. Technical Report SOCS-85.32, McGill University (1985)"},{"key":"9796_CR4","unstructured":"Bae, S.W., Korman, M., Mitchell, J.S.B., Okamoto, Y., Polishchuk, V., Wang, H.: Computing the L1 geodesic diameter and center of a polygonal domain. In: Ollinger, N., Vollmer, H. (eds) 33rd Symposium on Theoretical Aspects of Computer Science (STACS 2016). Leibniz International Proceedings in Informatics (LIPIcs), vol. 47, pp. 14:1\u201314:14. Schloss Dagstuhl\u2013Leibniz-Zentrum fuer Informatik, Dagstuhl (2016). ISBN 978-3-95977-001-9"},{"issue":"2","key":"9796_CR5","doi-asserted-by":"crossref","first-page":"306","DOI":"10.1007\/s00454-013-9527-8","volume":"50","author":"SW Bae","year":"2013","unstructured":"Bae, S.W., Korman, M., Okamoto, Y.: The geodesic diameter of polygonal domains. Discrete Comput. Geom. 50(2), 306\u2013329 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"9796_CR6","doi-asserted-by":"crossref","unstructured":"Bae, S.W., Korman, M., Okamoto, Y.: Computing the geodesic centers of a polygonal domain. In: Computational Geometry: Theory and Applications. Special issue of selected papers from the 26th Canadian Conference on Computational Geometry (CCCG\u201914) (2015) (in press)","DOI":"10.1016\/j.comgeo.2015.10.009"},{"issue":"6","key":"9796_CR7","doi-asserted-by":"crossref","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$$ 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":"9796_CR8","doi-asserted-by":"crossref","unstructured":"Chazelle B.: A theorem on polygon cutting with applications. In: Proceedings of FOCS, pp. 339\u2013349 (1982)","DOI":"10.1109\/SFCS.1982.58"},{"issue":"1","key":"9796_CR9","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comput. Geom. 6(1), 485\u2013524 (1991)","journal-title":"Discrete Comput. Geom."},{"key":"9796_CR10","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1007\/BF02293040","volume":"8","author":"H Djidjev","year":"1992","unstructured":"Djidjev, H., Lingas, A., Sack, J.-R.: An $$O(n\\log n)$$ O ( n log n ) algorithm for computing the link center of a simple polygon. Discrete Comput. Geom. 8, 131\u2013152 (1992)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"9796_CR11","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/77635.77639","volume":"9","author":"H Edelsbrunner","year":"1990","unstructured":"Edelsbrunner, H., M\u00fccke, E.P.: Simulation of simplicity: A technique to cope with degenerate cases in geometric algorithms. ACM Trans. Graph. 9(1), 66\u2013104 (1990)","journal-title":"ACM Trans. Graph."},{"issue":"1\u20134","key":"9796_CR12","doi-asserted-by":"crossref","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.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2(1\u20134), 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"9796_CR13","unstructured":"Harborth, H., M\u00f6ller, M.: The Esther-Klein-problem in the projective plane. Inst. Mathematik, TU Braunschweig (1993)"},{"issue":"2","key":"9796_CR14","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"9796_CR15","doi-asserted-by":"crossref","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":"9796_CR16","doi-asserted-by":"crossref","unstructured":"Ke, Y.: An efficient algorithm for link-distance problems. In: Proceedings of the Fifth Annual Symposium on Computational Geometry, pp. 69\u201378. ACM, Saarbr\u00fccken (1989)","DOI":"10.1145\/73833.73841"},{"issue":"3","key":"9796_CR17","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D-T Lee","year":"1984","unstructured":"Lee, D.-T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14(3), 393\u2013410 (1984)","journal-title":"Networks"},{"key":"9796_CR18","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Approximations and optimal geometric divide-and-conquer. In: Proceedings of the Twenty-Third Annual ACM Symposium on Theory of Computing, pp. 505\u2013511. ACM, New York (1991)","DOI":"10.1145\/103418.103470"},{"issue":"2","key":"9796_CR19","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1006\/jcss.1995.1018","volume":"50","author":"J Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: Approximations and optimal geometric divide-and-conquer. J. Comput. Syst. Sci. 50(2), 203\u2013208 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"9796_CR20","doi-asserted-by":"crossref","unstructured":"Matou\u0161ek, J.: Lectures on Discrete Geometry, Graduate Texts in Math, vol. 212. Springer, New York (2002)","DOI":"10.1007\/978-1-4613-0039-7"},{"issue":"1","key":"9796_CR21","doi-asserted-by":"crossref","first-page":"605","DOI":"10.1007\/BF02187750","volume":"4","author":"N Megiddo","year":"1989","unstructured":"Megiddo, N.: On the ball spanned by balls. Discrete Comput. Geom. 4(1), 605\u2013610 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9796_CR22","doi-asserted-by":"crossref","first-page":"633","DOI":"10.1016\/B978-044482537-7\/50016-4","volume-title":"Handbook of Computational Geometry","author":"JSB Mitchell","year":"2000","unstructured":"Mitchell, J.S.B.: Geometric shortest paths and network optimization. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 633\u2013701. Elsevier, Amsterdam (2000)"},{"key":"9796_CR23","doi-asserted-by":"crossref","unstructured":"Nilsoon, B.J., Schuierer, S.: Computing the rectilinear link diameter of a polygon. In: Computational Geometry\u2014Methods, Algorithms and Applications, pp. 203\u2013215. Springer, Berlin (1991)","DOI":"10.1007\/3-540-54891-2_15"},{"key":"9796_CR24","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1016\/0925-7721(95)00026-7","volume":"6","author":"BJ Nilsoon","year":"1996","unstructured":"Nilsoon, B.J., Schuierer, S.: An optimal algorithm for the rectilinear link center of a rectilinear polygon. Comput. Geom. 6, 169\u2013194 (1996)","journal-title":"Comput. Geom."},{"issue":"1","key":"9796_CR25","doi-asserted-by":"crossref","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(1), 611\u2013626 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9796_CR26","unstructured":"Suri, S.: Minimum link paths in polygons and related problems. PhD Thesis, Johns Hopkins University (1987)"},{"issue":"2","key":"9796_CR27","doi-asserted-by":"crossref","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."},{"issue":"436\u2013452","key":"9796_CR28","first-page":"137","volume":"48","author":"P Tur\u00e1n","year":"1941","unstructured":"Tur\u00e1n, P.: On an extremal problem in graph theory. Matematikai \u00e9s Fizikai Lapok 48(436\u2013452), 137 (1941)","journal-title":"Matematikai \u00e9s Fizikai Lapok"}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9796-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-016-9796-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-016-9796-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:11:37Z","timestamp":1498313497000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-016-9796-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,7,11]]},"references-count":28,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2016,12]]}},"alternative-id":["9796"],"URL":"https:\/\/doi.org\/10.1007\/s00454-016-9796-0","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"type":"print","value":"0179-5376"},{"type":"electronic","value":"1432-0444"}],"subject":[],"published":{"date-parts":[[2016,7,11]]}}}