{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:06:11Z","timestamp":1742958371403,"version":"3.40.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031343469"},{"type":"electronic","value":"9783031343476"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-34347-6_17","type":"book-chapter","created":{"date-parts":[[2023,6,2]],"date-time":"2023-06-02T23:03:35Z","timestamp":1685747015000},"page":"197-208","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Maximal Distortion of\u00a0Geodesic Diameters in\u00a0Polygonal Domains"],"prefix":"10.1007","author":[{"given":"Adrian","family":"Dumitrescu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Csaba D.","family":"T\u00f3th","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,3]]},"reference":[{"key":"17_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, 836\u2013859 (2016)","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"17_CR2","doi-asserted-by":"publisher","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":"17_CR3","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.comgeo.2015.10.009","volume":"77","author":"SW Bae","year":"2019","unstructured":"Bae, S.W., Korman, M., Okamoto, Y.: Computing the geodesic centers of a polygonal domain. Comput. Geom. 77, 3\u20139 (2019)","journal-title":"Comput. Geom."},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"Bose, P., Keil, J.M.: On the stretch factor of the constrained Delaunay triangulation. In: Proc. 3rd IEEE Symposium on Voronoi Diagrams in Science and Engineering (ISVD), pp. 25\u201331 (2006)","DOI":"10.1109\/ISVD.2006.28"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3218821","volume":"15","author":"S Cabello","year":"2019","unstructured":"Cabello, S.: Subquadratic algorithms for the diameter and the sum of pairwise distances in planar graphs. ACM Trans. Algorithms 15(2), 1\u201338 (2019)","journal-title":"ACM Trans. Algorithms"},{"key":"17_CR6","doi-asserted-by":"publisher","unstructured":"Chiang, Y.J., Mitchell, J.S.B.: Two-point Euclidean shortest path queries in the plane. In: Proc. 10th ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 215\u2013224 (1999). https:\/\/doi.org\/10.5555\/314500.314560","DOI":"10.5555\/314500.314560"},{"key":"17_CR7","unstructured":"Dalirrooyfard, M., Li, R., Williams, V.V.: Hardness of approximate diameter: Now for undirected graphs. In: Proc. 62nd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 1021\u20131032. IEEE (2021)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Maximal distortion of geodesic diameters in polygonal domains. arXiv preprint arXiv:2304.03484 (2023)","DOI":"10.1007\/978-3-031-34347-6_17"},{"issue":"8","key":"17_CR9","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1080\/00029890.2004.11920126","volume":"111","author":"SR Finch","year":"2004","unstructured":"Finch, S.R., Wetzel, J.E.: Lost in a forest. Am. Math. Mon. 111(8), 645\u2013654 (2004)","journal-title":"Am. Math. Mon."},{"issue":"2","key":"17_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1137\/18M1193402","volume":"50","author":"P Gawrychowski","year":"2021","unstructured":"Gawrychowski, P., Kaplan, H., Mozes, S., Sharir, M., Weimann, O.: Voronoi diagrams on planar graphs, and computing the diameter in deterministic $$\\tilde{O}(n^{5\/3})$$ time. SIAM J. Comput. 50(2), 509\u2013554 (2021)","journal-title":"SIAM J. Comput."},{"key":"17_CR11","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, 126\u2013152 (1989)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR12","first-page":"19","volume":"7","author":"S Har-Peled","year":"2015","unstructured":"Har-Peled, S.: Shortest path in a polygon using sublinear space. J. Comput. Geom. 7, 19\u201345 (2015)","journal-title":"J. Comput. Geom."},{"issue":"6","key":"17_CR13","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":"6","key":"17_CR14","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. 28(6), 2215\u20132256 (1999)","journal-title":"SIAM J. Comput."},{"key":"17_CR15","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/PL00009323","volume":"18","author":"S Kapoor","year":"1997","unstructured":"Kapoor, S., Maheshwari, S.N., Mitchell, J.S.B.: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete Comput. Geom. 18, 377\u2013383 (1997)","journal-title":"Discrete Comput. Geom."},{"key":"17_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2020.101709","volume":"93","author":"D K\u00fcbel","year":"2021","unstructured":"K\u00fcbel, D., Langetepe, E.: On the approximation of shortest escape paths. Comput. Geom. 93, 101709 (2021)","journal-title":"Comput. Geom."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14, 393\u2013410 (1984)","journal-title":"Networks"},{"issue":"3","key":"17_CR18","doi-asserted-by":"publisher","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\u2013332 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"17_CR19","unstructured":"Mitchell, J.S.: Shortest paths and networks. In: Handbook of Discrete and Computational Geometry, 3 edn. CRC Press, Boca Raton, FL (2017). Chap. 31"},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Roditty, L., Williams, V.V.: Fast approximation algorithms for the diameter and radius of sparse graphs. In: Proc. 45th Symposium on Theory of Computing Conference (STOC), pp. 515\u2013524. ACM (2013)","DOI":"10.1145\/2488608.2488673"},{"issue":"1","key":"17_CR21","first-page":"6","volume":"1","author":"PR Scott","year":"2000","unstructured":"Scott, P.R., Awyong, P.W.: Inequalities for convex sets. J. Inequal. Pure Appl. Math. 1(1), 6 (2000)","journal-title":"J. Inequal. Pure Appl. Math."},{"issue":"1","key":"17_CR22","first-page":"131","volume":"9","author":"H Wang","year":"2018","unstructured":"Wang, H.: On the geodesic centers of polygonal domains. J. Comput. Geom. 9(1), 131\u2013190 (2018)","journal-title":"J. Comput. Geom."},{"key":"17_CR23","doi-asserted-by":"crossref","unstructured":"Wang, H.: A new algorithm for Euclidean shortest paths in the plane. In: Proc. 53rd ACM Symposium on Theory of Computing (STOC), pp. 975\u2013988 (2021)","DOI":"10.1145\/3406325.3451037"},{"key":"17_CR24","doi-asserted-by":"crossref","unstructured":"Wang, H.: Shortest paths among obstacles in the plane revisited. In: Proc. 32nd ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 810\u2013821 (2021)","DOI":"10.1137\/1.9781611976465.51"},{"key":"17_CR25","unstructured":"Yaglom, I.M., Boltyanskii, V.G.: Convex Figures. Library of the Mathematical Circle (1951). Translated by Kelly, P.J., Walton, L.F., Holt, R.: Winston, New York (1961)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-34347-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,21]],"date-time":"2024-10-21T19:12:00Z","timestamp":1729537920000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-34347-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031343469","9783031343476"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-34347-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"3 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tainan","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Taiwan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 June 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 June 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2023.csie.ncku.edu.tw\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"86","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"33","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"38% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.04","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"5.69","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}