{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,26]],"date-time":"2026-03-26T03:20:05Z","timestamp":1774495205234,"version":"3.50.1"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2013,7,26]],"date-time":"2013-07-26T00:00:00Z","timestamp":1374796800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[2013,9]]},"DOI":"10.1007\/s00454-013-9527-8","type":"journal-article","created":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T17:50:42Z","timestamp":1374774642000},"page":"306-329","source":"Crossref","is-referenced-by-count":12,"title":["The Geodesic Diameter of Polygonal Domains"],"prefix":"10.1007","volume":"50","author":[{"given":"Sang Won","family":"Bae","sequence":"first","affiliation":[]},{"given":"Matias","family":"Korman","sequence":"additional","affiliation":[]},{"given":"Yoshio","family":"Okamoto","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,7,26]]},"reference":[{"key":"9527_CR1","unstructured":"Agarwal, P.K., Aronov, B., O\u2019Rourke, J., Schevon, C.A.: Star unfolding of a polytope with applications. SIAM J. Comput. 26(6), 1689\u20131713 (1997)"},{"key":"9527_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, 217\u2013255 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"9527_CR3","unstructured":"Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. Technical Report SOCS-85.32, McGill University, Montreal (1985)"},{"key":"9527_CR4","doi-asserted-by":"crossref","unstructured":"Bae, S.W., Chwa, K.-Y.: The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. In: Proceedings of 25th Annual Symposium Computational Geometry (SoCG), pp. 198\u2013207 (2009)","DOI":"10.1145\/1542362.1542402"},{"issue":"7","key":"9527_CR5","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/j.comgeo.2012.01.012","volume":"45","author":"SW Bae","year":"2012","unstructured":"Bae, S.W., Okamoto, Y.: Querying two boundary points for shortest paths in a polygonal domain. Comput. Geom. 45(7), 284\u2013293 (2012)","journal-title":"Comput. Geom."},{"key":"9527_CR6","doi-asserted-by":"crossref","unstructured":"Bae, S.W., Korman, M., Okamoto, Y.: The geodesic diameter of polygonal domains. In: Proceedings of 18th Annual European Symposium on Algorithms. Part 1. Lecture Notes in Computer Science, vol. 6346, pp. 500\u2013511 (2010)","DOI":"10.1007\/978-3-642-15775-2_43"},{"key":"9527_CR7","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: A theorem on polygon cutting with applications. In: Proceedings of 23rd Annual Symposium on Foundations of Computer Science (FOCS), pp. 339\u2013349 (1982)","DOI":"10.1109\/SFCS.1982.58"},{"key":"9527_CR8","unstructured":"Chiang, Y.-J., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: Proceedings of 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 215\u2013224 (1999)"},{"key":"9527_CR9","doi-asserted-by":"crossref","unstructured":"Cook, A.F., IV, Wenk, C.: Shortest path problems on a polyhedral surface. In: Proceedings of 11th International Symposium on Algorithms and Data Structures (WADS), pp. 156\u2013167 (2009)","DOI":"10.1007\/978-3-642-03367-4_14"},{"issue":"2","key":"9527_CR10","doi-asserted-by":"crossref","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."},{"key":"9527_CR11","doi-asserted-by":"crossref","unstructured":"Guo, H., Maheshwari, A., Sack, J.-R.: Shortest path queries in polygonal domains. In: Proceedings of the 4th International Conference on Algorithmic Aspects in Information and Management (AAIM). Lecture Notes in Computer Science, vol. 5034, pp. 200\u2013211 (2008)","DOI":"10.1007\/978-3-540-68880-8_20"},{"issue":"6","key":"9527_CR12","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."},{"issue":"6","key":"9527_CR13","doi-asserted-by":"crossref","first-page":"2215","DOI":"10.1137\/S0097539795289604","volume":"28","author":"J Hershberger","year":"1999","unstructured":"Hershberger, J., Suri, S.: An optimal algorithm for Euclidean shortest paths in the plane. SIAM J. Comput. 28(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"key":"9527_CR14","unstructured":"Koivisto, M., Polishchuk, V.: Geodesic diameter of a polygonal domain in $$O(n^4\\log n)$$ O ( n 4 log n ) time. CoRR, http:\/\/arxiv\/abs\/1006.1998 (2010)"},{"issue":"3","key":"9527_CR15","doi-asserted-by":"crossref","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"JSB Mitchell","year":"1996","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Int. J. Comput. Geom. Appl. 6(3), 309\u2013331 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9527_CR16","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Handbook of Discrete and Computational Geometry, 2nd edn, Chap. 27, pp. 607\u2013641. CRC Press, Boca Raton (2004)","DOI":"10.1201\/9781420035315.ch27"},{"key":"9527_CR17","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J., Schevon, C.: Computing the geodesic diameter of a 3-polytope. In: Proceedings of the 5th Annual Symposium on Computational Geometry (SoCG), pp. 370\u2013379 (1989)","DOI":"10.1145\/73833.73874"},{"key":"9527_CR18","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J., Suri, S.: Polygons. In: Handbook of Discrete and Computational Geometry, 2nd edn, Chap. 26, pp. 583\u2013606. CRC Press, Boca Raton (2004)","DOI":"10.1201\/9781420035315.ch26"},{"issue":"6","key":"9527_CR19","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(6), 611\u2013626 (1989)","journal-title":"Discrete Comput. Geom."},{"key":"9527_CR20","doi-asserted-by":"crossref","unstructured":"Suri, S.: The all-geodesic-furthest neighbors problem for simple polygons. In: Proceedings of 3rd Annual Symposium on Computational Geometry (SoCG), pp. 64\u201375 (1987)","DOI":"10.1145\/41958.41965"},{"issue":"4","key":"9527_CR21","doi-asserted-by":"crossref","first-page":"511","DOI":"10.1007\/s10958-007-0431-8","volume":"140","author":"VA Zalgaller","year":"2007","unstructured":"Zalgaller, V.A.: An isoperimetric problem for tetrahedra. J. Math. Sci. 140(4), 511\u2013527 (2007)","journal-title":"J. Math. Sci."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9527-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00454-013-9527-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00454-013-9527-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,19]],"date-time":"2019-07-19T14:59:31Z","timestamp":1563548371000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00454-013-9527-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7,26]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,9]]}},"alternative-id":["9527"],"URL":"https:\/\/doi.org\/10.1007\/s00454-013-9527-8","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,7,26]]}}}