{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T10:22:11Z","timestamp":1725790931592},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642544224"},{"type":"electronic","value":"9783642544231"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-642-54423-1_11","type":"book-chapter","created":{"date-parts":[[2014,3,24]],"date-time":"2014-03-24T23:02:27Z","timestamp":1395702147000},"page":"120-131","source":"Crossref","is-referenced-by-count":2,"title":["Computing the L 1 Geodesic Diameter and Center of a Simple Polygon in Linear Time"],"prefix":"10.1007","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal, A., Klawe, M., Moran, S., Shor, P., Wilbur, R.: Geometric applications of a matrix-searching algorithm. Algorithmica\u00a02, 195\u2013208 (1987)","journal-title":"Algorithmica"},{"key":"11_CR2","unstructured":"Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. Technical Report SOCS-85.32. McGill University (1985)"},{"issue":"2","key":"11_CR3","doi-asserted-by":"publisher","first-page":"306","DOI":"10.1007\/s00454-013-9527-8","volume":"50","author":"S.W. Bae","year":"2013","unstructured":"Bae, S.W., Korman, M., Okamoto, Y.: The geodesic diameter of polygonal domains. Discrete Comput. Geom.\u00a050(2), 306\u2013329 (2013)","journal-title":"Discrete Comput. Geom."},{"key":"11_CR4","unstructured":"Bae, S.W., Korman, M., Okamoto, Y., Wang, H.: Computing the L\n                  1 geodesic diameter and center of a simple polygon in linear time. ArXiv e-prints (2013), arXiv:1312.3711"},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/BF00147365","volume":"60","author":"M. Breen","year":"1996","unstructured":"Breen, M.: A Helly-type theorem for simple polygons. Geometriae Dedicata\u00a060, 283\u2013288 (1996)","journal-title":"Geometriae Dedicata"},{"key":"11_CR6","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: A theorem on polygon cutting with applications. In: Proc. 23rd Annu. Sympos. Found. Comput. Sci. (FOCS 1982), pp. 339\u2013349 (1982)","DOI":"10.1109\/SFCS.1982.58"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/BF02293040","volume":"8","author":"H. Djidjev","year":"1992","unstructured":"Djidjev, H., Lingas, A., Sack, J.R.: An O(nlogn) algorithm for computing the link center of a simple polygon. Discrete Comput. Geom.\u00a08, 131\u2013152 (1992)","journal-title":"Discrete Comput. Geom."},{"key":"11_CR8","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L.J. 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\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"2","key":"11_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.: Theory and Appl.\u00a04(2), 63\u201397 (1994)","journal-title":"Comput. Geom.: Theory and Appl."},{"issue":"6","key":"11_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.\u00a026(6), 1612\u20131634 (1997)","journal-title":"SIAM J. Comput."},{"key":"11_CR11","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1016\/j.ipl.2010.11.007","volume":"111","author":"M.J. Katz","year":"2011","unstructured":"Katz, M.J., Morgenstern, G.: Settling the bound on the rectilinear link radius of a simple rectilinear polygon. Inform. Proc. Lett.\u00a0111, 103\u2013106 (2011)","journal-title":"Inform. Proc. Lett."},{"key":"11_CR12","unstructured":"Ke, Y.: An efficient algorithm for link-distance problems. In: Proc. 5th Annu. Sympos. Comput. Geom. (SoCG 1989), pp. 69\u201378 (1989)"},{"key":"11_CR13","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Handbook of Discrete and Computational Geometry, ch. 27, 2nd edn., pp. 607\u2013641. CRC Press, Inc. (2004)","DOI":"10.1201\/9781420035315.ch27"},{"key":"11_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/3-540-54891-2_15","volume-title":"Computational Geometry - Methods, Algorithms and Applications","author":"B.J. Nilsson","year":"1991","unstructured":"Nilsson, B.J., Schuierer, S.: Computing the rectilinear link diameter of a polygon. In: Bieri, H., Noltemeier, H. (eds.) CG-WS 1991. LNCS, vol.\u00a0553, pp. 203\u2013215. Springer, Heidelberg (1991)"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1016\/0925-7721(95)00026-7","volume":"6","author":"B.J. Nilsson","year":"1996","unstructured":"Nilsson, B.J., Schuierer, S.: An optimal algorithm for the rectilinear link center of a rectilinear polygon. Comput. Geom.: Theory and Appl.\u00a06, 169\u2013194 (1996)","journal-title":"Comput. Geom.: Theory and Appl."},{"issue":"6","key":"11_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.\u00a04(6), 611\u2013626 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"11_CR17","doi-asserted-by":"crossref","unstructured":"Schuierer, S.: Computing the L\n                  1-diameter and center of a simple rectilinear polygon. In: Proc. Int. Conf. on Computing and Information (ICCI 1994), pp. 214\u2013229 (1994)","DOI":"10.1007\/3-540-58218-5_30"},{"key":"11_CR18","doi-asserted-by":"crossref","unstructured":"Suri, S.: The all-geodesic-furthest neighbors problem for simple polygons. In: Proc. 3rd Annu. Sympos. Comput. Geom. (SoCG 1987), pp. 64\u201375 (1987)","DOI":"10.1145\/41958.41965"},{"key":"11_CR19","unstructured":"Suri, S.: Minimum Link Paths in Polygons and Related Problems. Ph.D. thesis. Johns Hopkins Univ. (1987)"},{"issue":"2","key":"11_CR20","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.\u00a039(2), 220\u2013235 (1989)","journal-title":"J. Comput. Syst. Sci."}],"container-title":["Lecture Notes in Computer Science","LATIN 2014: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-54423-1_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T08:53:33Z","timestamp":1558860813000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-54423-1_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783642544224","9783642544231"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-54423-1_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}