{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:59:39Z","timestamp":1740099579440,"version":"3.37.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030340285"},{"type":"electronic","value":"9783030340292"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34029-2_21","type":"book-chapter","created":{"date-parts":[[2019,11,14]],"date-time":"2019-11-14T03:02:40Z","timestamp":1573700560000},"page":"317-331","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["An Experimental Study of Algorithms for Geodesic Shortest Paths in the Constant-Workspace Model"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8480-1726","authenticated-orcid":false,"given":"Jonas","family":"Cleve","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1948-5840","authenticated-orcid":false,"given":"Wolfgang","family":"Mulzer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,11,14]]},"reference":[{"issue":"8","key":"21_CR1","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1016\/j.comgeo.2013.04.005","volume":"46","author":"T Asano","year":"2013","unstructured":"Asano, T.: Memory-constrained algorithms for simple polygons. Comput. Geom. Theory Appl. 46(8), 959\u2013969 (2013)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"21_CR2","first-page":"46","volume":"2","author":"T Asano","year":"2011","unstructured":"Asano, T., Mulzer, W., Rote, G., Wang, Y.: Constant-work-space algorithms for geometric problems. J. Comput. Geom. 2(1), 46\u201368 (2011)","journal-title":"J. Comput. Geom."},{"issue":"5","key":"21_CR3","doi-asserted-by":"publisher","first-page":"569","DOI":"10.7155\/jgaa.00240","volume":"15","author":"T Asano","year":"2011","unstructured":"Asano, T., Mulzer, W., Wang, Y.: Constant-work-space algorithms for shortest paths in trees and simple polygons. J. Graph Algorithms Appl. 15(5), 569\u2013586 (2011)","journal-title":"J. Graph Algorithms Appl."},{"key":"21_CR4","doi-asserted-by":"crossref","unstructured":"Auer, T., Held, M.: Heuristics for the generation of random polygons. In: Proceedings of 8th Canadian Conference on Computational Geometry (CCCG), pp. 38\u201343 (1996)","DOI":"10.1515\/9780773591134-009"},{"key":"21_CR5","unstructured":"Baffier, J.F., Diez, Y., Korman, M.: Experimental study of compressed stack algorithms in limited memory environments. In: Proceedings of 17th International Symposium Experimental Algorithms (SEA), pp. 19:1\u201319:13 (2018)"},{"issue":"2","key":"21_CR6","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1145\/3232679.3232692","volume":"49","author":"B Banyassady","year":"2018","unstructured":"Banyassady, B., Korman, M., Mulzer, W.: Computational geometry column 67. SIGACT News 49(2), 77\u201394 (2018)","journal-title":"SIGACT News"},{"key":"21_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Theory and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Theory and Applications, 3rd edn. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-77974-2","edition":"3"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discret. Comput. Geom. 6, 485\u2013524 (1991)","journal-title":"Discret. Comput. Geom."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"LP Chew","year":"1989","unstructured":"Chew, L.P.: Constrained Delaunay triangulations. Algorithmica 4, 97\u2013108 (1989)","journal-title":"Algorithmica"},{"key":"21_CR10","unstructured":"Dierker, S., Ehrhardt, M., Ihrig, J., Rohde, M., Thobe, S., Tugan, K.: Abschlussbericht zum Softwareprojekt: Zuf\u00e4llige Polygone und k\u00fcrzeste Wege. Institut f\u00fcr Informatik, Freie Universit\u00e4t, Berlin (2012). https:\/\/github.com\/marehr\/simple-polygon-generator"},{"key":"21_CR11","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"issue":"2","key":"21_CR12","first-page":"19","volume":"7","author":"S Har-Peled","year":"2016","unstructured":"Har-Peled, S.: Shortest path in a polygon using sublinear space. J. Comput. Geom. 7(2), 19\u201345 (2016)","journal-title":"J. Comput. Geom."},{"issue":"3","key":"21_CR13","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1109\/MCSE.2007.55","volume":"9","author":"JD Hunter","year":"2007","unstructured":"Hunter, J.D.: Matplotlib: a 2D graphics environment. Comput. Sci. Eng. 9(3), 90\u201395 (2007)","journal-title":"Comput. Sci. Eng."},{"issue":"3","key":"21_CR14","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(3), 393\u2013410 (1984)","journal-title":"Networks"},{"key":"21_CR15","unstructured":"Python Software Foundation: Python. https:\/\/www.python.org\/ . version 3.5"},{"key":"21_CR16","unstructured":"Rufat, D.: Python Triangle (2016). http:\/\/dzhelil.info\/triangle\/ . version 20160203"},{"key":"21_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/BFb0014497","volume-title":"Applied Computational Geometry Towards Geometric Engineering","author":"JR Shewchuk","year":"1996","unstructured":"Shewchuk, J.R.: Triangle: engineering a 2D quality mesh generator and Delaunay triangulator. In: Lin, M.C., Manocha, D. (eds.) WACG 1996. LNCS, vol. 1148, pp. 203\u2013222. Springer, Heidelberg (1996). https:\/\/doi.org\/10.1007\/BFb0014497"},{"issue":"2","key":"21_CR18","first-page":"327","volume":"41","author":"T Tantau","year":"2007","unstructured":"Tantau, T.: Logspace optimization problems and their approximability properties. Theor. Comput. Sci. 41(2), 327\u2013350 (2007)","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Analysis of Experimental Algorithms"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34029-2_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,9,22]],"date-time":"2023-09-22T22:39:27Z","timestamp":1695422367000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34029-2_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030340285","9783030340292"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34029-2_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Experimental Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Kalamata","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"wea2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.caopt.com\/SEA2019\/","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":"45","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":"35","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":"78% - 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":"2","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":"2","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}