{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T19:31:32Z","timestamp":1757619092456,"version":"3.44.0"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031987397"},{"type":"electronic","value":"9783031987403"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-98740-3_3","type":"book-chapter","created":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T23:48:42Z","timestamp":1752796122000},"page":"31-43","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Guarding Terrains with\u00a0Guards on\u00a0a\u00a0Line"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0000-1140-237X","authenticated-orcid":false,"given":"Byeonguk","family":"Kang","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0504-7839","authenticated-orcid":false,"given":"Hwi","family":"Kim","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7177-1679","authenticated-orcid":false,"given":"Hee-Kap","family":"Ahn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,7,18]]},"reference":[{"issue":"2","key":"3_CR1","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/s00453-008-9270-3","volume":"58","author":"PK Agarwal","year":"2010","unstructured":"Agarwal, P.K., et al.: Guarding a terrain by two watchtowers. Algorithmica 58(2), 352\u2013390 (2010)","journal-title":"Algorithmica"},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1006\/jagm.1998.0984","volume":"30","author":"N Amenta","year":"1999","unstructured":"Amenta, N., Bern, M., Eppstein, D.: Optimal point placement for mesh smoothing. J. Algorithms 30(2), 302\u2013322 (1999)","journal-title":"J. Algorithms"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/3-540-44679-6_14","volume-title":"Computing and Combinatorics","author":"S Bespamyatnikh","year":"2001","unstructured":"Bespamyatnikh, S., Chen, Z., Wang, K., Zhu, B.: On the planar two-watchtower problem. In: Wang, J. (ed.) COCOON 2001. LNCS, vol. 2108, pp. 121\u2013130. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44679-6_14"},{"key":"3_CR4","unstructured":"Biniaz, A., Maheshwari, A., Mitchell, J.S., Odak, S., Polishchuk, V., Shermer, T.: Contiguous boundary guarding. arXiv preprint arXiv:2412.15053 (2024)"},{"key":"3_CR5","unstructured":"Chen, D.Z., Estivill-Castro, V., Urrutia, J.: Optimal guarding of polygons and monotone chains. In: 7th Canadian Conference on Computational Geometry (CCCG 1995), pp. 133\u2013138 (1995)"},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1016\/S0747-7171(89)80003-3","volume":"7","author":"R Cole","year":"1989","unstructured":"Cole, R., Sharir, M.: Visibility problems for polyhedral terrains. J. Symb. Comput. 7(1), 11\u201330 (1989)","journal-title":"J. Symb. Comput."},{"key":"3_CR7","doi-asserted-by":"publisher","first-page":"22","DOI":"10.1016\/j.comgeo.2019.07.004","volume":"84","author":"O Daescu","year":"2019","unstructured":"Daescu, O., Friedrichs, S., Malik, H., Polishchuk, V., Schmidt, C.: Altitude terrain guarding and guarding uni-monotone polygons. Comput. Geom. 84, 22\u201335 (2019)","journal-title":"Comput. Geom."},{"key":"3_CR8","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: In 2nd Annual Symposium on Computational Geometry (SCG 1986), pp. 1\u201313 (1986)","DOI":"10.1145\/10515.10516"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Kang, B., Choi, J., Han, J., Ahn, H.K.: Guarding points on a terrain by watchtowers. In: 36th Canadian Conference on Computational Geometry (CCCG 2024), pp. 41\u201347 (2024)","DOI":"10.2139\/ssrn.4850503"},{"key":"3_CR10","doi-asserted-by":"crossref","unstructured":"Kang, B., Kim, H., Ahn, H.K.: Guarding terrains with guards on a line. arXiv preprint arXiv:2505.02373 (2025)","DOI":"10.1007\/978-3-031-98740-3_3"},{"key":"3_CR11","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1007\/s11464-009-0049-x","volume":"5","author":"N Katoh","year":"2010","unstructured":"Katoh, N., Wang, W., Xu, Y., Zhu, B.: Parametric search: three new applications. Front. Math. China 5, 65\u201373 (2010)","journal-title":"Front. Math. China"},{"issue":"5","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1137\/100791506","volume":"40","author":"J King","year":"2011","unstructured":"King, J., Krohn, E.: Terrain guarding is NP-hard. SIAM J. Comput. 40(5), 1316\u20131339 (2011)","journal-title":"SIAM J. Comput."},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"McCoy, B., Zhu, B., Dutt, A.: Guarding precise and imprecise polyhedral terrains with segments. In: International Conference on Combinatorial Optimization and Applications, pp. 323\u2013336. Springer, Cham (2023)","DOI":"10.1007\/978-3-031-49614-1_24"},{"issue":"4","key":"3_CR14","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM (JACM) 30(4), 852\u2013865 (1983)","journal-title":"J. ACM (JACM)"},{"issue":"1","key":"3_CR15","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM (JACM) 31(1), 114\u2013127 (1984)","journal-title":"J. ACM (JACM)"},{"key":"3_CR16","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2022.101918","volume":"109","author":"R Seth","year":"2023","unstructured":"Seth, R., Maheshwari, A., Nandy, S.C.: Acrophobic guard watchtower problem. Comput. Geom. 109, 101918 (2023)","journal-title":"Comput. Geom."},{"key":"3_CR17","unstructured":"Sharir, M., Agarwal, P.K.: Davenport-Schinzel Sequences and Their Geometric Applications. Cambridge University Press (1995)"},{"key":"3_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/978-3-319-78455-7_9","volume-title":"Frontiers in Algorithmics","author":"N Tripathi","year":"2018","unstructured":"Tripathi, N., Pal, M., De, M., Das, G., Nandy, S.C.: Guarding polyhedral terrain by k-watchtowers. In: Chen, J., Lu, P. (eds.) FAW 2018. LNCS, vol. 10823, pp. 112\u2013125. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-78455-7_9"}],"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-98740-3_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,9,7]],"date-time":"2025-09-07T13:48:19Z","timestamp":1757252899000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-98740-3_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031987397","9783031987403"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-98740-3_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"18 July 2025","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":"Bozeman, MT","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":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 July 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"36","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.cs.montana.edu\/bhz\/iwoca2025\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}