{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T16:29:53Z","timestamp":1742920193175,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031488818"},{"type":"electronic","value":"9783031488825"}],"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-48882-5_1","type":"book-chapter","created":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T18:02:07Z","timestamp":1701540127000},"page":"1-12","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Segment Visibility for\u00a0k-Transmitters"],"prefix":"10.1007","author":[{"given":"Yeganeh","family":"Bahoo","sequence":"first","affiliation":[]},{"given":"Somnath","family":"Kundu","sequence":"additional","affiliation":[]},{"given":"Kody","family":"Manastyrski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,3]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Avis, D., Toussaint, G.T.: An optimal algorithm for determining the visibility of a polygon from an edge. IEEE Trans. Comput. C-30, 910\u2013914 (1981)","DOI":"10.1109\/TC.1981.1675729"},{"key":"1_CR2","unstructured":"Bahoo, Y., Bose, P., Durocher, S.: Watchtower for k-crossing visibility. In: CCCG (2019)"},{"key":"1_CR3","doi-asserted-by":"publisher","first-page":"1292","DOI":"10.1007\/s00224-020-09999-0","volume":"64","author":"Y Bahoo","year":"2020","unstructured":"Bahoo, Y., Bose, P., Durocher, S., Shermer, T.C.: Computing the k-visibility region of a point in a polygon. Theory Comput. Syst. 64, 1292\u20131306 (2020)","journal-title":"Theory Comput. Syst."},{"key":"1_CR4","doi-asserted-by":"crossref","unstructured":"Bahoo, Y., Khorasani, A.M., Eskandari, M., Sorouri, M.: 2-modem pursuit-evasion problem. In: EuroCG (2013)","DOI":"10.2139\/ssrn.3862144"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1007\/s00453-018-0433-6","volume":"81","author":"T Biedl","year":"2019","unstructured":"Biedl, T., et al.: Guarding orthogonal art galleries with sliding k-transmitters: hardness and approximation. Algorithmica 81, 69\u201397 (2019)","journal-title":"Algorithmica"},{"key":"1_CR6","unstructured":"Biedl, T., Mehrabi, S., Yu, Z.: Sliding k-transmitters: hardness and approximation. arXiv preprint arXiv:1607.07364 (2016)"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Cannon, S., Fai, T.G., Iwerks, J., Leopold, U., Schmidt, C.: Combinatorics and complexity of guarding polygons with edge and point 2-transmitters. Comput. Geom. 68, 89\u2013100 (2018)","DOI":"10.1016\/j.comgeo.2017.06.004"},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: A combinatorial theorem in plane geometry. J. Comb. Theory Seri. B 18, 39\u201341 (1975)","journal-title":"J. Comb. Theory Seri. B"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"344","DOI":"10.1007\/BF01901192","volume":"3","author":"JA Dean","year":"1988","unstructured":"Dean, J.A., Lingas, A., Sack, J.R.: Recognizing polygons, or how to spy. Visual Comput. 3, 344\u2013355 (1988)","journal-title":"Visual Comput."},{"key":"1_CR10","unstructured":"Evans, W., Sember, J.: k-star-shaped polygons. In: CCCG, pp. 215\u2013218 (2010)"},{"issue":"2","key":"1_CR11","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1016\/0020-0190(90)90111-A","volume":"35","author":"KY Fung","year":"1990","unstructured":"Fung, K.Y., Nicholl, T.M., Tarjan, R.E., Van Wyk, C.J.: Simplified linear-time Jordan sorting and polygon clipping. Inf. Process. Lett. 35(2), 85\u201392 (1990)","journal-title":"Inf. Process. Lett."},{"key":"1_CR12","doi-asserted-by":"crossref","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside simple polygons. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 1\u201313 (1986)","DOI":"10.1145\/10515.10516"},{"key":"1_CR13","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0734-189X(86)90044-7","volume":"34","author":"D Lee","year":"1986","unstructured":"Lee, D., Lin, A.: Computing the visibility polygon from an edge. Comput. Vision Graph. Image Process. 34, 1\u201319 (1986)","journal-title":"Comput. Vision Graph. Image Process."},{"key":"1_CR14","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/j.tcs.2020.02.008","volume":"815","author":"SS Mahdavi","year":"2020","unstructured":"Mahdavi, S.S., Seddighin, S., Ghodsi, M.: Covering orthogonal polygons with sliding k-transmitters. Theor. Comput. Sci. 815, 163\u2013181 (2020)","journal-title":"Theor. Comput. Sci."},{"key":"1_CR15","unstructured":"Monroy, R.F., Vargas, A.R., Fucugauchi, J.U.: On modem illumination problems. In: XIII Encuentros de Geometr\u00eda Computacional: Zaragoza, del 29 de junio al 1 de julio de 2009, pp. 9\u201319. Prensas Universitarias de Zaragoza (2009)"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"459","DOI":"10.1007\/BF01910636","volume":"10","author":"N Mouawad","year":"1994","unstructured":"Mouawad, N., Shermer, T.: The superman problem. Visual Comput. 10, 459\u2013473 (1994)","journal-title":"Visual Comput."},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Suri, S., O\u2019Rourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: Proceedings of the Second Annual Symposium on Computational Geometry, pp. 14\u201323 (1986)","DOI":"10.1145\/10515.10517"},{"key":"1_CR18","doi-asserted-by":"crossref","unstructured":"Zomorodian, A., Edelsbrunner, H.: Fast software for box intersections. In: Proceedings of the Sixteenth Annual Symposium on Computational Geometry, pp. 129\u2013138 (2000)","DOI":"10.1145\/336154.336192"}],"container-title":["Lecture Notes in Computer Science","Algorithmics of Wireless Networks"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-48882-5_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,2]],"date-time":"2023-12-02T18:02:15Z","timestamp":1701540135000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-48882-5_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031488818","9783031488825"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-48882-5_1","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 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOWIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithmics of Wireless Networks","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","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 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/algowin\/","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":"15","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":"10","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":"67% - 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":"4","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":"3","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)"}}]}}