{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:10:49Z","timestamp":1742911849417,"version":"3.40.3"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031491894"},{"type":"electronic","value":"9783031491900"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-49190-0_5","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:02:36Z","timestamp":1702026156000},"page":"71-82","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Approximating the\u00a0$$\\lambda $$-low-density Value"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6778-7990","authenticated-orcid":false,"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3417-5303","authenticated-orcid":false,"given":"Zijin","family":"Huang","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3803-3804","authenticated-orcid":false,"given":"Sampson","family":"Wong","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"5_CR1","doi-asserted-by":"publisher","unstructured":"Alt, H., Efrat, A., Rote, G., Wenk, C.: Matching planar maps. J. Algorithms. 49(2), 262\u2013283 (2003). https:\/\/doi.org\/10.1016\/S0196-6774(03)00085-3, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0196677403000853","DOI":"10.1016\/S0196-6774(03)00085-3"},{"key":"5_CR2","doi-asserted-by":"publisher","unstructured":"Alt, H., Godau, M.: Computing the Fr\u00e9chet distance between two polygonal curves. Int. J. Comput. Geom. Appl. 05, 75\u201391 (1995). https:\/\/doi.org\/10.1142\/S0218195995000064, https:\/\/www.worldscientific.com\/doi\/abs\/10.1142\/S0218195995000064","DOI":"10.1142\/S0218195995000064"},{"key":"5_CR3","doi-asserted-by":"publisher","unstructured":"de Berg, M., Katz, M., van der Stappen, A.F., Vleugels, J.: Realistic input models for geometric algorithms. In: Proceedings of the thirteenth annual symposium on Computational geometry, pp. 294\u2013303. SCG 1997, Association for Computing Machinery, New York, NY, USA (1997). https:\/\/doi.org\/10.1145\/262839.262986","DOI":"10.1145\/262839.262986"},{"key":"5_CR4","unstructured":"Buchin, K., Buchin, M., Gudmundsson, J., Popov, A., Wong, S.: Map matching queries under Fr\u00e9chet distance on low-density spanners. In: European Workshop on Computational Geometry (2023)"},{"key":"5_CR5","doi-asserted-by":"publisher","unstructured":"Chen, D., Driemel, A., Guibas, L.J., Nguyen, A., Wenk, C.: Approximate map matching with respect to the Fr\u00e9chet distance. In: 2011 Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX), pp. 75\u201383. Proceedings, Society for Industrial and Applied Mathematics, January 2011. https:\/\/doi.org\/10.1137\/1.9781611972917.8, https:\/\/epubs.siam.org\/doi\/abs\/10.1137\/1.9781611972917.8","DOI":"10.1137\/1.9781611972917.8"},{"key":"5_CR6","doi-asserted-by":"publisher","unstructured":"Driemel, A., Har-Peled, S., Wenk, C.: Approximating the Fr\u00e9chet distance for realistic curves in near linear time. Discr. Comput. Geom. 48(1), 94\u2013127 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9402-z","DOI":"10.1007\/s00454-012-9402-z"},{"key":"5_CR7","doi-asserted-by":"publisher","unstructured":"Gudmundsson, J., Seybold, M.P., Wong, S.: Map matching queries on realistic input graphs under the Fr\u00e9chet distance. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1464\u20131492. Society for Industrial and Applied Mathematics, January 2023. https:\/\/doi.org\/10.1137\/1.9781611977554.ch53","DOI":"10.1137\/1.9781611977554.ch53"},{"key":"5_CR8","doi-asserted-by":"publisher","unstructured":"Gudmundsson, J., Sha, Y., Wong, S.: Approximating the Packedness of polygonal curves. Comput. Geom. 108, 101920 (2023). https:\/\/doi.org\/10.1016\/j.comgeo.2022.101920, https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0925772122000633","DOI":"10.1016\/j.comgeo.2022.101920"},{"key":"5_CR9","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/173","volume-title":"Geometric Approximation Algorithms","author":"S Har-Peled","year":"2011","unstructured":"Har-Peled, S.: Geometric Approximation Algorithms. American Mathematical Society, USA (2011)"},{"key":"5_CR10","unstructured":"Har-Peled, S., Zhou, T.: How Packed Is It, Really? May 2021. https:\/\/arxiv.org\/abs\/2105.10776v1"},{"key":"5_CR11","doi-asserted-by":"publisher","unstructured":"Schwarzkopf, O., Vleugels, J.: Range searching in low-density environments. Inf. Process. Lett. 60(3), 121\u2013127 (1996). https:\/\/doi.org\/10.1016\/S0020-0190(96)00154-8","DOI":"10.1016\/S0020-0190(96)00154-8"},{"key":"5_CR12","doi-asserted-by":"publisher","unstructured":"van der Stappen, A.F., Overmars, M.H.: Motion planning amidst fat obstacles. In: Proceedings of the Tenth Annual Symposium on Computational Geometry, pp. 31\u201340. SCG 1994, Association for Computing Machinery, New York, NY, USA, June 1994. https:\/\/doi.org\/10.1145\/177424.177453","DOI":"10.1145\/177424.177453"},{"issue":"1","key":"5_CR13","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1007\/BF01258292","volume":"11","author":"AF Van Der Stappen","year":"1994","unstructured":"Van Der Stappen, A.F.: The complexity of the free space for motion planning amidst fat obstacles. J. Intell. Robot. Syst. 11(1), 21\u201344 (1994). https:\/\/doi.org\/10.1007\/BF01258292","journal-title":"J. Intell. Robot. Syst."}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49190-0_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T09:08:38Z","timestamp":1702026518000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49190-0_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031491894","9783031491900"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49190-0_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOON","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computing and Combinatorics Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawaii, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOON2023\/org.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Springer EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"146","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":"60","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":"41% - 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","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":"6","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)"}}]}}