{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:15:25Z","timestamp":1725563725052},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642157745"},{"type":"electronic","value":"9783642157752"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-15775-2_43","type":"book-chapter","created":{"date-parts":[[2010,9,1]],"date-time":"2010-09-01T10:47:32Z","timestamp":1283338052000},"page":"500-511","source":"Crossref","is-referenced-by-count":1,"title":["The Geodesic Diameter of Polygonal Domains"],"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":[]}],"member":"297","reference":[{"issue":"6","key":"43_CR1","doi-asserted-by":"publisher","first-page":"1689","DOI":"10.1137\/S0097539793253371","volume":"26","author":"P.K. Agarwal","year":"1997","unstructured":"Agarwal, P.K., Aronov, B., O\u2019Rourke, J., Schevon, C.A.: Star unfolding of a polytope with applications. SIAM J. Comput.\u00a026(6), 1689\u20131713 (1997)","journal-title":"SIAM J. Comput."},{"key":"43_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 Voronoi diagram. Discrete Comput. Geom.\u00a09, 217\u2013255 (1993)","journal-title":"Discrete Comput. Geom."},{"key":"43_CR3","unstructured":"Asano, T., Toussaint, G.: Computing the geodesic center of a simple polygon. Technical Report SOCS-85.32, McGill University (1985)"},{"key":"43_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: Proc. 25th Annu. Sympos. Comput. Geom. (SoCG), pp. 198\u2013207 (2009)","DOI":"10.1145\/1542362.1542402"},{"key":"43_CR5","unstructured":"Bae, S.W., Korman, M., Okamoto, Y.: The geodesic diameter of polygonal domains. arXiv preprint (2010), arXiv:1001.0695"},{"key":"43_CR6","unstructured":"Bae, S.W., Okamoto, Y.: Querying two boundary points for shortest paths in a polygonal domain. In: Dong, Y., Du, D.-Z., Ibarra, O. (eds.) ISAAC 2009. LNCS, vol.\u00a05878, pp. 1054\u20131063. Springer, Heidelberg (2009), arXiv:0911.5017"},{"key":"43_CR7","doi-asserted-by":"crossref","unstructured":"Chazelle, B.: A theorem on polygon cutting with applications. In: Proc. 23rd Annu. Sympos. Found. Comput. Sci. (FOCS), pp. 339\u2013349 (1982)","DOI":"10.1109\/SFCS.1982.58"},{"key":"43_CR8","unstructured":"Chiang, Y.-J., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: Proc. 10th ACM-SIAM Sympos. Discrete Algorithms (SODA), pp. 215\u2013224 (1999)"},{"key":"43_CR9","doi-asserted-by":"crossref","unstructured":"Cook IV, A.F., Wenk, C.: Shortest path problems on a polyhedral surface. In: Proc. 11th Internat. Sympos. Algo. Data Struct (WADS), pp. 156\u2013167 (2009)","DOI":"10.1007\/978-3-642-03367-4_14"},{"issue":"2","key":"43_CR10","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/0022-0000(89)90041-X","volume":"39","author":"L.J. Guibas","year":"1989","unstructured":"Guibas, L.J., Hershberger, J.: Optimal shortest path queries in a simple polygon. J. Comput. Syst. Sci.\u00a039(2), 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"43_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/978-3-540-68880-8_20","volume-title":"Algorithmic Aspects in Information and Management","author":"H. Guo","year":"2008","unstructured":"Guo, H., Maheshwari, A., Sack, J.-R.: Shortest path queries in polygonal domains. In: Fleischer, R., Xu, J. (eds.) AAIM 2008. LNCS, vol.\u00a05034, pp. 200\u2013211. Springer, Heidelberg (2008)"},{"issue":"6","key":"43_CR12","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."},{"issue":"6","key":"43_CR13","doi-asserted-by":"publisher","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.\u00a028(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"43_CR14","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1142\/S0218195996000216","volume":"6","author":"J.S.B. Mitchell","year":"1996","unstructured":"Mitchell, J.S.B.: Shortest paths among obstacles in the plane. Internat. J. Comput. Geom. Appl.\u00a06(3), 309\u2013331 (1996)","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"43_CR15","first-page":"607","volume-title":"Handbook of Discrete and Computational Geometry","author":"J.S.B. Mitchell","year":"2004","unstructured":"Mitchell, J.S.B.: Shortest paths and networks. In: Handbook of Discrete and Computational Geometry, 2nd edn., ch.\u00a027, pp. 607\u2013641. CRC Press, Inc., Boca Raton (2004)","edition":"2"},{"key":"43_CR16","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J., Schevon, C.: Computing the geodesic diameter of a 3-polytope. In: Proc. 5th Annu. Sympos. Comput. Geom. (SoCG), pp. 370\u2013379 (1989)","DOI":"10.1145\/73833.73874"},{"key":"43_CR17","doi-asserted-by":"crossref","unstructured":"O\u2019Rourke, J., Suri, S.: Polygons. In: Handbook of Discrete and Computational Geometry, 2nd edn., ch.\u00a026, pp. 583\u2013606. CRC Press, Inc., Boca Raton (2004)","DOI":"10.1201\/9781420035315.ch26"},{"issue":"6","key":"43_CR18","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":"43_CR19","doi-asserted-by":"crossref","unstructured":"Suri, S.: The all-geodesic-furthest neighbors problem for simple polygons. In: Proc. 3rd Annu. Sympos. Comput. Geom. (SoCG), pp. 64\u201375 (1987)","DOI":"10.1145\/41958.41965"},{"issue":"4","key":"43_CR20","doi-asserted-by":"publisher","first-page":"511","DOI":"10.1007\/s10958-007-0431-8","volume":"140","author":"V.A. Zalgaller","year":"2007","unstructured":"Zalgaller, V.A.: An isoperimetric problem for tetrahedra. Journal of Mathematical Sciences\u00a0140(4), 511\u2013527 (2007)","journal-title":"Journal of Mathematical Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2010"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-15775-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,2]],"date-time":"2019-06-02T20:18:34Z","timestamp":1559506714000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-15775-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642157745","9783642157752"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-15775-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}