{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T10:02:23Z","timestamp":1751536943300,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030581497"},{"type":"electronic","value":"9783030581503"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-58150-3_25","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"311-323","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Shortest Watchman Tours in Simple Polygons Under Rotated Monotone Visibility"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1342-8618","authenticated-orcid":false,"given":"Bengt J.","family":"Nilsson","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5403-8467","authenticated-orcid":false,"given":"David","family":"Orden","sequence":"additional","affiliation":[]},{"given":"Leonidas","family":"Palios","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0095-1725","authenticated-orcid":false,"given":"Carlos","family":"Seara","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6378-7742","authenticated-orcid":false,"given":"Pawe\u0142","family":"\u017byli\u0144ski","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"543","DOI":"10.1007\/s00224-018-9885-y","volume":"63","author":"C Alegr\u00eda-Galicia","year":"2019","unstructured":"Alegr\u00eda-Galicia, C., Orden, D., Palios, L., Seara, C., Urrutia, J.: Capturing points with a rotating polygon (and a 3D extension). Theory Comput. Syst. 63(3), 543\u2013566 (2019)","journal-title":"Theory Comput. Syst."},{"key":"25_CR2","doi-asserted-by":"crossref","unstructured":"Alegr\u00eda-Galicia, C., Orden, D., Seara, C., Urrutia, J.: Efficient computation of minimum-area rectilinear convex hull under rotation and generalizations. arXiv:1710.10888v2 (2019)","DOI":"10.1007\/s10898-020-00953-5"},{"key":"25_CR3","doi-asserted-by":"crossref","unstructured":"Asano, T., Ghosh, S.K., Shermer, T.: Chapter 19. Visibility in the plane. In: Sack, J.R., Urrutia, J. (eds.) Handbook on Computational Geometry. Elsevier Science Publishers (1999)","DOI":"10.1016\/B978-044482537-7\/50020-6"},{"key":"25_CR4","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/PL00009467","volume":"22","author":"S Carlsson","year":"1999","unstructured":"Carlsson, S., Jonsson, H., Nilsson, B.J.: Finding the shortest watchman route in a simple polygon. Discrete Comp. Geom. 22, 377\u2013402 (1999)","journal-title":"Discrete Comp. Geom."},{"issue":"3","key":"25_CR5","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1007\/BF02574703","volume":"6","author":"B Chazelle","year":"1991","unstructured":"Chazelle, B.: Triangulating a simple polygon in linear time. Discrete Comp. Geom. 6(3), 485\u2013524 (1991)","journal-title":"Discrete Comp. Geom."},{"key":"25_CR6","unstructured":"Chin, W., Ntafos, S.: Optimum watchman routes"},{"issue":"1","key":"25_CR7","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1007\/BF02574671","volume":"6","author":"W Chin","year":"1991","unstructured":"Chin, W., Ntafos, S.: Shortest watchman routes in simple polygons. Discrete Comp. Geom. 6(1), 9\u201331 (1991)","journal-title":"Discrete Comp. Geom."},{"key":"25_CR8","doi-asserted-by":"crossref","unstructured":"Dror, M., Efrat, A., Lubiw, A., Mitchell, J.S.B.: Touring a sequence of polygons. In: 35th STOC 2003, pp. 473\u2013482 (2003)","DOI":"10.1145\/780542.780612"},{"issue":"7","key":"25_CR9","doi-asserted-by":"publisher","first-page":"326","DOI":"10.1016\/j.comgeo.2012.02.001","volume":"45","author":"A Dumitrescu","year":"2012","unstructured":"Dumitrescu, A., T\u00f3th, C.D.: Watchman tours for polygons with holes. Comput. Geom. 45(7), 326\u2013333 (2012)","journal-title":"Comput. Geom."},{"issue":"7","key":"25_CR10","doi-asserted-by":"publisher","first-page":"1019","DOI":"10.1016\/0031-3203(94)00158-I","volume":"28","author":"LP Gewali","year":"1995","unstructured":"Gewali, L.P.: Recognizing $$s$$-star polygons. Patt. Rec. 28(7), 1019\u20131032 (1995)","journal-title":"Patt. Rec."},{"key":"25_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"key":"25_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/BFb0036185","volume-title":"Fundamentals of Computation Theory","author":"M Hammar","year":"1997","unstructured":"Hammar, M., Nilsson, B.J.: Concerning the time bounds of existing shortest watchman route algorithms. In: Chlebus, B.S., Czaja, L. (eds.) FCT 1997. LNCS, vol. 1279, pp. 210\u2013221. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0036185"},{"key":"25_CR13","unstructured":"Heron of Alexandria. Catoptrica (On Reflection). $$\\sim \\!62$$"},{"issue":"3","key":"25_CR14","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J Hershberger","year":"1995","unstructured":"Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: shoot a ray, take a walk. J. Algorithms 18(3), 403\u2013431 (1995)","journal-title":"J. Algorithms"},{"issue":"2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/s10846-018-0951-0","volume":"95","author":"G Huski\u0107","year":"2019","unstructured":"Huski\u0107, G., Buck, S., Zell, A.: GeRoNa: generic robot navigation. J. Intell. Robot. Syst. 95(2), 419\u2013442 (2019)","journal-title":"J. Intell. Robot. Syst."},{"key":"25_CR16","doi-asserted-by":"crossref","unstructured":"Icking, C., Klein, R.: Searching for the kernel of a polygon: a competitive strategy. In: 11th SoCG 1995, pp. 258\u2013266 (1995)","DOI":"10.1145\/220279.220307"},{"key":"25_CR17","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"DT Lee","year":"1984","unstructured":"Lee, D.T., Preparata, F.P.: Euclidean shortest paths in the presence of rectilinear barriers. Networks 14, 393\u2013410 (1984)","journal-title":"Networks"},{"key":"25_CR18","doi-asserted-by":"crossref","unstructured":"Mitchell, J.S.B.: Approximating watchman routes. In: 24th SODA 2013, pp. 844\u2013855 (2013)","DOI":"10.1137\/1.9781611973105.60"},{"key":"25_CR19","unstructured":"Mitchell, J.S.B.,Wynters, E.L.: Watchman routes for multiple guards. In: 3rd CCCG 1991, pp. 126\u2013129 (1991)"},{"key":"25_CR20","unstructured":"Nilsson, B.J., Packer, E.: An approximation algorithm for the two-watchman route in a simple polygon. In: 32nd EuroCG 2016, pp. 111\u2013114 (2016)"},{"key":"25_CR21","unstructured":"Orden, D., Palios, L., Seara, C., Urrutia, J., \u017byli\u0144ski, P.: On the width of the monotone-visibility kernel of a simple polygon. In: 36th EuroCG 2020, pp. 13:1\u201313:8 (2020)"},{"key":"25_CR22","unstructured":"Orden, D., Palios, L., Seara, C., \u017byli\u0144ski, P.: Generalized kernels of polygons under rotation. In: 34th EuroCG 2018, pp. 74:1\u201374:6 (2018)"},{"key":"25_CR23","unstructured":"Palios, L.: An output-sensitive algorithm for computing the $$s$$-kernel. In: 27th CCCG 2015, pp. 199\u2013204 (2015)"},{"key":"25_CR24","unstructured":"Schuierer, S., Rawlins, G.J.E., Wood, D.: A generalization of staircase visibility. In: 3rd CCCG 1991, pp. 96\u201399 (1991)"},{"key":"25_CR25","unstructured":"Schuierer, S., Wood, D.: Generalized kernels of polygons with holes. In: 5th CCCG 1993, pp. 222\u2013227 (1993)"},{"key":"25_CR26","unstructured":"Schuierer, S., Wood, D.: Multiple-guards kernels of simple polygons. Theoretical Computer Science Center Research Report HKUST-TCSC-98-06 (1998)"},{"issue":"1","key":"25_CR27","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/S0020-0190(00)00146-0","volume":"77","author":"X-H Tan","year":"2001","unstructured":"Tan, X.-H.: Fast computation of shortest watchman routes in simple polygons. Inf. Process. Lett. 77(1), 27\u201333 (2001)","journal-title":"Inf. Process. Lett."},{"key":"25_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/3-540-57568-5_236","volume-title":"Algorithms and Computation","author":"X Tan","year":"1993","unstructured":"Tan, X., Hirata, T.: Constructing shortest watchman routes by divide-and-conquer. In: Ng, K.W., Raghavan, P., Balasubramanian, N.V., Chin, F.Y.L. (eds.) ISAAC 1993. LNCS, vol. 762, pp. 68\u201377. Springer, Heidelberg (1993). https:\/\/doi.org\/10.1007\/3-540-57568-5_236"},{"issue":"4","key":"25_CR29","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1142\/S0218195993000233","volume":"3","author":"X-H Tan","year":"1993","unstructured":"Tan, X.-H., Hirata, T., Inagaki, Y.: An incremental algorithm for constructing shortest watchman routes. Int. J. Comput. Geom. Appl. 3(4), 351\u2013365 (1993)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"3","key":"25_CR30","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1142\/S0218195999000212","volume":"9","author":"X-H Tan","year":"1999","unstructured":"Tan, X.-H., Hirata, T., Inagaki, Y.: Corrigendum to \u201cAn incremental Algorithm for constructing shortest watchman routes\u201d. Int. J. Comput. Geom. Appl. 9(3), 319\u2013324 (1999)","journal-title":"Int. J. Comput. Geom. Appl."}],"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-030-58150-3_25","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,23]],"date-time":"2021-04-23T19:41:21Z","timestamp":1619206881000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_25","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"27 August 2020","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":"Atlanta, GA","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":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoon2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cocoon-conference.org\/2020\/","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":"126","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":"54","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":"43% - 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":"2.7","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":"10.2","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}