{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:38:07Z","timestamp":1759639087588,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031221040"},{"type":"electronic","value":"9783031221057"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-031-22105-7_36","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T02:36:12Z","timestamp":1672540572000},"page":"406-418","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Generalized Sweeping Line Spanners"],"prefix":"10.1007","author":[{"given":"Keenan","family":"Lee","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9294-9947","authenticated-orcid":false,"given":"Andr\u00e9","family":"van Renssen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"9","key":"36_CR1","doi-asserted-by":"publisher","first-page":"910","DOI":"10.1016\/j.comgeo.2014.05.001","volume":"47","author":"O Aichholzer","year":"2014","unstructured":"Aichholzer, O., et al.: Theta-3 is connected. Comput. Geom.: Theory Appl. (CGTA) 47(9), 910\u2013917 (2014)","journal-title":"Comput. Geom.: Theory Appl. (CGTA)"},{"key":"36_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/978-3-642-40104-6_10","volume-title":"Algorithms and Data Structures","author":"L Barba","year":"2013","unstructured":"Barba, L., Bose, P., De Carufel, J.L., van Renssen, A., Verdonschot, S.: On the stretch factor of the Theta-4 graph. In: Dehne, F., Solis-Oba, R., Sack, J.R. (eds.) Algorithms and Data Structures. LNCS, vol. 8037, pp. 109\u2013120. Springer, Cham (2013). https:\/\/doi.org\/10.1007\/978-3-642-40104-6_10"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/978-3-642-16926-7_25","volume-title":"Proceedings of the 36th International Conference on Graph Theoretic Concepts in Computer Science (WG 2010)","author":"N Bonichon","year":"2010","unstructured":"Bonichon, N., Gavoille, C., Hanusse, N., Ilcinkas, D.: Connections between theta-graphs, Delaunay triangulations, and orthogonal surfaces. In: Proceedings of the 36th International Conference on Graph Theoretic Concepts in Computer Science (WG 2010), vol. 6410, pp. 266\u2013278. Springer, Cham (2010). https:\/\/doi.org\/10.1007\/978-3-642-16926-7_25"},{"key":"36_CR4","doi-asserted-by":"crossref","unstructured":"Bose, P., De Carufel, J.-L., Hill, D., Smid, M.: On the spanning and routing ratio of Theta-four. In: Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2019), pp. 2361\u20132370 (2019)","DOI":"10.1137\/1.9781611975482.144"},{"key":"36_CR5","doi-asserted-by":"publisher","first-page":"70","DOI":"10.1016\/j.tcs.2015.12.017","volume":"616","author":"P Bose","year":"2016","unstructured":"Bose, P., De Carufel, J.L., Morin, P., van Renssen, A., Verdonschot, S.: Towards tight bounds on theta-graphs: More is not always better. Theor. Comput. Sci. (TCS) 616, 70\u201393 (2016)","journal-title":"Theor. Comput. Sci. (TCS)"},{"issue":"4","key":"36_CR6","doi-asserted-by":"publisher","first-page":"1392","DOI":"10.1007\/s00453-018-0476-8","volume":"81","author":"P Bose","year":"2019","unstructured":"Bose, P., Fagerberg, R., van Renssen, A., Verdonschot, S.: On plane constrained bounded-degree spanners. Algorithmica 81(4), 1392\u20131415 (2019). https:\/\/doi.org\/10.1007\/s00453-018-0476-8","journal-title":"Algorithmica"},{"issue":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/j.comgeo.2004.01.003","volume":"28","author":"P Bose","year":"2004","unstructured":"Bose, P., Gudmundsson, J., Morin, P.: Ordered theta graphs. Comput. Geom. Theory Appl. (CGTA) 28(1), 11\u201318 (2004)","journal-title":"Comput. Geom. Theory Appl. (CGTA)"},{"key":"36_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1007\/978-3-030-83508-8_16","volume-title":"Proceedings of the 17th Algorithms and Data Structures Symposium (WADS 2021)","author":"P Bose","year":"2021","unstructured":"Bose, P., Hill, D., Ooms, A.: Improved bounds on the spanning ratio of the theta-5-graph. In: Lubiw, A., Salavatipour, M. (eds.) Proceedings of the 17th Algorithms and Data Structures Symposium (WADS 2021). LNCS, vol. 12808, pp. 215\u2013228. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-83508-8_16"},{"issue":"2","key":"36_CR9","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1016\/j.comgeo.2014.08.005","volume":"48","author":"P Bose","year":"2015","unstructured":"Bose, P., Morin, P., van Renssen, A., Verdonschot, S.: The $$\\theta _5$$-graph is a spanner. Comput. Geom.: Theory Appl. (CGTA) 48(2), 108\u2013119 (2015)","journal-title":"Comput. Geom.: Theory Appl. (CGTA)"},{"issue":"02","key":"36_CR10","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1142\/S021819591950002X","volume":"29","author":"P Bose","year":"2019","unstructured":"Bose, P., van Renssen, A.: Spanning properties of Yao and $$\\theta $$-graphs in the presence of constraints. Int. J. Comput. Geom. Appl. (IJCGA) 29(02), 95\u2013120 (2019)","journal-title":"Int. J. Comput. Geom. Appl. (IJCGA)"},{"issue":"7","key":"36_CR11","doi-asserted-by":"publisher","first-page":"818","DOI":"10.1016\/j.comgeo.2013.04.002","volume":"46","author":"P Bose","year":"2013","unstructured":"Bose, P., Smid, M.: On plane geometric spanners: a survey and open problems. Comput. Geom. Theory Appl. (CGTA) 46(7), 818\u2013830 (2013)","journal-title":"Comput. Geom. Theory Appl. (CGTA)"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Clarkson, K.: Approximation algorithms for shortest path motion planning. In: Proceedings of the 19th Annual ACM Symposium on Theory of Computing (STOC 1987), pp. 56\u201365 (1987)","DOI":"10.1145\/28395.28402"},{"key":"36_CR13","unstructured":"Das, G.: The visibility graph contains a bounded-degree spanner. In: Proceedings of the 9th Canadian Conference on Computational Geometry (CCCG 1997), pp. 70\u201375 (1997)"},{"key":"36_CR14","unstructured":"El Molla, N.M.: Yao spanners for wireless ad hoc networks. Villanova University (2009)"},{"key":"36_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"208","DOI":"10.1007\/3-540-19487-8_23","volume-title":"SWAT 88","author":"JM Keil","year":"1988","unstructured":"Keil, J.M.: Approximating the complete Euclidean graph. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 208\u2013213. Springer, Heidelberg (1988). https:\/\/doi.org\/10.1007\/3-540-19487-8_23"},{"key":"36_CR16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546884","volume-title":"Geometric Spanner Networks","author":"G Narasimhan","year":"2007","unstructured":"Narasimhan, G., Smid, M.: Geometric Spanner Networks. Cambridge University Press, Cambridge (2007)"},{"key":"36_CR17","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/j.tcs.2020.12.024","volume":"854","author":"A van Renssen","year":"2021","unstructured":"van Renssen, A., Wong, G.: Bounded-degree spanners in the presence of polygonal obstacles. Theor. Comput. Sci. (TCS) 854, 159\u2013173 (2021)","journal-title":"Theor. Comput. Sci. (TCS)"},{"key":"36_CR18","unstructured":"Ruppert, J., Seidel, R.: Approximating the $$d$$-dimensional complete Euclidean graph. In: Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG 1991), pp. 207\u2013210 (1991)"}],"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-22105-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,3,30]],"date-time":"2023-03-30T22:05:48Z","timestamp":1680213948000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-22105-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031221040","9783031221057"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-22105-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 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":"Shenzhen","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 October 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2022\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"101","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":"39","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":"12","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":"39% - 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":"5","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)"}}]}}