{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T15:38:19Z","timestamp":1762097899221,"version":"build-2065373602"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496134"},{"type":"electronic","value":"9783031496141"}],"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-49614-1_24","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"323-336","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Guarding Precise and\u00a0Imprecise Polyhedral Terrains with\u00a0Segments"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-1450-5978","authenticated-orcid":false,"given":"Bradley","family":"McCoy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3929-4128","authenticated-orcid":false,"given":"Binhai","family":"Zhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aakash","family":"Dutt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"issue":"2","key":"24_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"},{"key":"24_CR2","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"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1142\/S0218195992000238","volume":"2","author":"BK Bhattacharya","year":"1992","unstructured":"Bhattacharya, B.K., Czyzowicz, J., Egyed, P., Toussaint, G.T., Stojmenovic, I., Urrutia, J.: Computing shortest transversals of sets. Int. J. Comput. Geom. Appl. 2(4), 417\u2013442 (1992)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"24_CR4","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1016\/0925-7721(95)00034-8","volume":"7","author":"P Bose","year":"1997","unstructured":"Bose, P., Shermer, T.C., Toussaint, G.T., Zhu, B.: Guarding polyhedral terrains. Comput. Geom. Theo. Appl. 7, 173\u2013185 (1997)","journal-title":"Comput. Geom. Theo. Appl."},{"issue":"1","key":"24_CR5","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."},{"issue":"1","key":"24_CR6","first-page":"38","volume":"4","author":"A Driemel","year":"2013","unstructured":"Driemel, A., Haverkort, H.J., L\u00f6ffler, M., Silveira, R.I.: Flow computations on imprecise terrains. J. Comput. Geom. 4(1), 38\u201378 (2013)","journal-title":"J. Comput. Geom."},{"key":"24_CR7","unstructured":"Duraisamy, N., et al.: Half-guarding weakly-visible polygons and terrains. In: Dawar, A., Guruswami, V., editors, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS\u20192022), December 18\u201320, 2022, IIT Madras, Chennai, India, volume 250 of LIPIcs, pp. 18:1\u201318:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2022)"},{"key":"24_CR8","unstructured":"Gray, C., Evans, W.S.: Optimistic shortest paths on uncertain terrains. In: Proceedings of the 16th Canadian Conference on Computational Geometry (CCCG\u20192004), Concordia University, Montr\u00e9al, Qu\u00e9bec, Canada, August 9\u201311, 2004, pp. 68\u201371 (2004)"},{"issue":"7","key":"24_CR9","doi-asserted-by":"publisher","first-page":"334","DOI":"10.1016\/j.comgeo.2012.02.002","volume":"45","author":"C Gray","year":"2012","unstructured":"Gray, C., Kammer, F., L\u00f6ffler, M., Silveira, R.I.: Removing local extrema from imprecise terrains. Comput. Geom. Theo. Appl. 45(7), 334\u2013349 (2012)","journal-title":"Comput. Geom. Theo. Appl."},{"key":"24_CR10","doi-asserted-by":"crossref","unstructured":"Gray, C., L\u00f6ffler, M., Silveira, R.I.: Smoothing imprecise 1.5d terrains. Int. J. Comput. Geom. Appl. 20(4), 381\u2013414 (2010)","DOI":"10.1142\/S0218195910003359"},{"issue":"2","key":"24_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., Yinfeng, X., Zhu, B.: Parametric search: three new applications. Front. Math. China 5(2), 65\u201373 (2010)","journal-title":"Front. Math. China"},{"key":"24_CR12","doi-asserted-by":"crossref","unstructured":"Lee, D.T., Preparata, F.P.: An optimal algorithm for finding the kernel of a polygon. J. ACM 26(3), 415\u2013421 (1979)","DOI":"10.1145\/322139.322142"},{"key":"24_CR13","unstructured":"Lubiw, A., Stroud, G.: Computing realistic terrains from imprecise elevations. In: Y. Bahoo., Georgiou, K., editors, Proceedings of the 34th Canadian Conference on Computational Geometry, (CCCG\u20192022), Toronto Metropolitan University, Toronto, Ontario, Canada, August 25\u201327, 2022, pp. 227\u2013234 (2022)"},{"key":"24_CR14","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/0304-3975(79)90055-0","volume":"8","author":"FP Preparata","year":"1979","unstructured":"Preparata, F.P., Muller, D.E.: Finding the intersection of n half-spaces in time O(n log n). Theor. Comput. Sci. 8, 45\u201355 (1979)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR15","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. Theo. Appl. 109, 101918 (2023)","journal-title":"Comput. Geom. Theo. Appl."},{"issue":"5","key":"24_CR16","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1016\/0020-0190(88)90120-2","volume":"29","author":"M Sharir","year":"1988","unstructured":"Sharir, M.: The shortest watchtower and related problems for polyhedral terrains. Inf. Process. Lett. 29(5), 265\u2013270 (1988)","journal-title":"Inf. Process. Lett."},{"key":"24_CR17","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"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"Vaidya, P.M.: Speeding-up linear programming using fast matrix multiplication (extended abstract). In: 30th Annual Symposium on Foundations of Computer Science, Research Triangle Park, North Carolina, USA, 30 October - 1 November 1989, pp. 332\u2013337. IEEE Computer Society (1989)","DOI":"10.1109\/SFCS.1989.63499"},{"issue":"1\u20132","key":"24_CR19","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/S0304-3975(98)00132-7","volume":"234","author":"C Wang","year":"2000","unstructured":"Wang, C., Zhu, B.: Three dimensional weak visibility: complexity and algorithms. Theor. Comput. Sci. 234(1\u20132), 219\u2013232 (2000)","journal-title":"Theor. Comput. Sci."},{"key":"24_CR20","unstructured":"Zhu, B.: Improved algorithms for computing the shortest watchtower of polyhedral terrains. In: Proceedings of the 3rd Canadian Conference on Computational Geometry (CCCG\u20191992), St. John\u2019s, Newfoundland, Canada, August 1992, pp. 286\u2013291. Memorial University of Newfoundland (1992)"},{"key":"24_CR21","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/S0925-7721(96)00009-0","volume":"8","author":"B Zhu","year":"1997","unstructured":"Zhu, B.: Computing the shortest watchtower of a polyhedral terrain in O(n log n) time. Comput. Geom. Theo. Appl. 8, 181\u2013193 (1997)","journal-title":"Comput. Geom. Theo. Appl."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49614-1_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:04:47Z","timestamp":1707555887000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49614-1_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496134","9783031496141"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49614-1_24","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":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, 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":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","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":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","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":"73","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":"62% - 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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}