{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:37:38Z","timestamp":1742999858792,"version":"3.40.3"},"publisher-location":"Cham","reference-count":32,"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_11","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T01:02:42Z","timestamp":1598490162000},"page":"136-148","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Visibility Polygon Queries Among Dynamic Polygonal Obstacles in Plane"],"prefix":"10.1007","author":[{"given":"Sanjana","family":"Agrawal","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Inkulu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,27]]},"reference":[{"unstructured":"Akbari, K., Ghodsi, M.: Visibility maintenance of a moving segment observer inside polygons with holes. In: Proceedings of Canadian Conference on Computational Geometry, pp. 117\u2013120 (2010)","key":"11_CR1"},{"issue":"4","key":"11_CR2","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/s00454-001-0089-9","volume":"27","author":"B Aronov","year":"2002","unstructured":"Aronov, B., Guibas, L.J., Teichmann, M., Zhang, L.: Visibility queries and maintenance in simple polygons. Discrete Comput. Geom. 27(4), 461\u2013483 (2002). https:\/\/doi.org\/10.1007\/s00454-001-0089-9","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"11_CR3","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T Asano","year":"1986","unstructured":"Asano, T., Asano, T., Guibas, L.J., Hershberger, J., Imai, H.: Visibility of disjoint polygons. Algorithmica 1(1), 49\u201363 (1986). https:\/\/doi.org\/10.1007\/BF01840436","journal-title":"Algorithmica"},{"issue":"4","key":"11_CR4","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1142\/S0218195994000252","volume":"4","author":"R Bar-Yehuda","year":"1994","unstructured":"Bar-Yehuda, R., Chazelle, B.: Triangulating disjoint Jordan chains. Int. J. Comput. Geom. Appl. 4(4), 475\u2013481 (1994)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"11_CR5","doi-asserted-by":"publisher","first-page":"371","DOI":"10.1016\/j.comgeo.2012.10.004","volume":"46","author":"MN Baygi","year":"2013","unstructured":"Baygi, M.N., Ghodsi, M.: Space\/query-time tradeoff for computing the visibility polygon. Comput. Geom. 46, 371\u2013381 (2013)","journal-title":"Comput. Geom."},{"issue":"3","key":"11_CR6","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1016\/S0925-7721(01)00070-0","volume":"23","author":"P Bose","year":"2002","unstructured":"Bose, P., Lubiw, A., Munro, J.I.: Efficient visibility queries in simple polygons. Comput. Geom. 23(3), 313\u2013335 (2002)","journal-title":"Comput. Geom."},{"issue":"5","key":"11_CR7","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1016\/S0020-0190(97)00211-1","volume":"65","author":"DZ Chen","year":"1998","unstructured":"Chen, D.Z., Daescu, O.: Maintaining visibility of a polygon with a moving point of view. Inf. Process. Lett. 65(5), 269\u2013275 (1998)","journal-title":"Inf. Process. Lett."},{"issue":"2","key":"11_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.comgeo.2014.08.003","volume":"48","author":"DZ Chen","year":"2015","unstructured":"Chen, D.Z., Wang, H.: Visibility and ray shooting queries in polygonal domains. Comput. Geom. 48(2), 31\u201341 (2015)","journal-title":"Comput. Geom."},{"key":"11_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1007\/978-3-030-11509-8_4","volume-title":"Algorithms and Discrete Applied Mathematics","author":"T Choudhury","year":"2019","unstructured":"Choudhury, T., Inkulu, R.: Maintaining the visibility graph of a dynamic simple polygon. In: Pal, S.P., Vijayakumar, A. (eds.) CALDAM 2019. LNCS, vol. 11394, pp. 42\u201352. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11509-8_4"},{"key":"11_CR10","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms. The MIT Press, Cambridge (2009)"},{"issue":"1","key":"11_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/0146-664X(79)90076-5","volume":"11","author":"LS Davis","year":"1979","unstructured":"Davis, L.S., Benedikt, M.L.: Computational models of space: isovists and isovist fields. Comput. Graph. Image Process. 11(1), 49\u201372 (1979)","journal-title":"Comput. Graph. Image Process."},{"issue":"2","key":"11_CR12","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"HA ElGindy","year":"1981","unstructured":"ElGindy, H.A., Avis, D.: A linear algorithm for computing the visibility polygon from a point. J. Algorithms 2(2), 186\u2013197 (1981)","journal-title":"J. Algorithms"},{"issue":"1","key":"11_CR13","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/0196-6774(91)90024-S","volume":"12","author":"SK Ghosh","year":"1991","unstructured":"Ghosh, S.K.: Computing the visibility polygon from a convex set and related problems. J. Algorithms 12(1), 75\u201395 (1991)","journal-title":"J. Algorithms"},{"key":"11_CR14","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"issue":"5","key":"11_CR15","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"SK Ghosh","year":"1991","unstructured":"Ghosh, S.K., Mount, D.M.: An output-sensitive algorithm for computing visibility graphs. SIAM J. Comput. 20(5), 888\u2013910 (1991)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"11_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1006\/jagm.1995.0797","volume":"23","author":"MT Goodrich","year":"1997","unstructured":"Goodrich, M.T., Tamassia, R.: Dynamic ray shooting and shortest paths in planar subdivisions via balanced geodesic triangulations. J. Algorithms 23(1), 51\u201373 (1997)","journal-title":"J. Algorithms"},{"issue":"1","key":"11_CR17","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/S0097539791221505","volume":"24","author":"PJ Heffernan","year":"1995","unstructured":"Heffernan, P.J., Mitchell, J.S.B.: An optimal algorithm for computing visibility in the plane. SIAM J. Comput. 24(1), 184\u2013201 (1995)","journal-title":"SIAM J. Comput."},{"issue":"9","key":"11_CR18","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1016\/j.comgeo.2009.02.004","volume":"42","author":"R Inkulu","year":"2009","unstructured":"Inkulu, R., Kapoor, S.: Visibility queries in a polygonal region. Comput. Geom. 42(9), 852\u2013864 (2009)","journal-title":"Comput. Geom."},{"key":"11_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1007\/978-3-319-53007-9_19","volume-title":"Algorithms and Discrete Applied Mathematics","author":"R Inkulu","year":"2017","unstructured":"Inkulu, R., Thakur, N.P.: Incremental algorithms to update visibility polygons. In: Gaur, D., Narayanaswamy, N.S. (eds.) CALDAM 2017. LNCS, vol. 10156, pp. 205\u2013218. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53007-9_19"},{"unstructured":"Inkulu, R., Sowmya, K., Thakur, N.P.: Dynamic algorithms for visibility polygons in simple polygons (CoRR 1704.08219) (2020). Accepted to Int. J. Comput. Geom. Appl","key":"11_CR20"},{"issue":"4","key":"11_CR21","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1007\/BF01937271","volume":"27","author":"B Joe","year":"1987","unstructured":"Joe, B., Simpson, R.: Corrections to Lee\u2019s visibility polygon algorithm. BIT Numer. Math. 27(4), 458\u2013473 (1987). https:\/\/doi.org\/10.1007\/BF01937271","journal-title":"BIT Numer. Math."},{"doi-asserted-by":"crossref","unstructured":"Kapoor, S.: Efficient computation of geodesic shortest paths. In: Proceedings of Symposium on Theory of Computing, pp. 770\u2013779 (1999)","key":"11_CR22","DOI":"10.1145\/301250.301449"},{"doi-asserted-by":"crossref","unstructured":"Kapoor, S., Maheshwari, S.N.: Efficient algorithms for Euclidean shortest path and visibility problems with polygonal obstacles. In: Proceedings of Symposium on Computational Geometry, pp. 172\u2013182 (1988)","key":"11_CR23","DOI":"10.1145\/73393.73411"},{"issue":"3","key":"11_CR24","doi-asserted-by":"publisher","first-page":"847","DOI":"10.1137\/S0097539795253591","volume":"30","author":"S Kapoor","year":"2000","unstructured":"Kapoor, S., Maheshwari, S.N.: Efficiently constructing the visibility graph of a simple polygon with obstacles. SIAM J. Comput. 30(3), 847\u2013871 (2000)","journal-title":"SIAM J. Comput."},{"issue":"4","key":"11_CR25","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/PL00009323","volume":"18","author":"S Kapoor","year":"1997","unstructured":"Kapoor, S., Maheshwari, S.N., Mitchell, J.S.B.: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete Comput. Geom. 18(4), 377\u2013383 (1997). https:\/\/doi.org\/10.1007\/PL00009323","journal-title":"Discrete Comput. Geom."},{"issue":"2","key":"11_CR26","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","volume":"22","author":"DT Lee","year":"1983","unstructured":"Lee, D.T.: Visibility of a simple polygon. Comput. Vis. Graph. Image Process. 22(2), 207\u2013221 (1983)","journal-title":"Comput. Vis. Graph. Image Process."},{"issue":"7","key":"11_CR27","first-page":"4165","volume":"16","author":"L Lu","year":"2011","unstructured":"Lu, L., Yang, C., Wang, J.: Point visibility computing in polygons with holes. J. Inf. Comput. Sci. 16(7), 4165\u20134173 (2011)","journal-title":"J. Inf. Comput. Sci."},{"issue":"2","key":"11_CR28","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"MH Overmars","year":"1981","unstructured":"Overmars, M.H., van Leewen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23(2), 166\u2013204 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"11_CR29","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF02712876","volume":"16","author":"M Pocchiola","year":"1996","unstructured":"Pocchiola, M., Vegter, G.: Topologically sweeping visibility complexes via pseudotriangulations. Discrete Comput. Geom. 16(4), 419\u2013453 (1996). https:\/\/doi.org\/10.1007\/BF02712876","journal-title":"Discrete Comput. Geom."},{"key":"11_CR30","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"doi-asserted-by":"crossref","unstructured":"Suri, S., O\u2019Rourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: Proceedings of the Symposium on Computational Geometry, pp. 14\u201323 (1986)","key":"11_CR31","DOI":"10.1145\/10515.10517"},{"doi-asserted-by":"crossref","unstructured":"Zarei, A., Ghodsi, M.: Efficient computation of query point visibility in polygons with holes. In: Proceedings of the Symposium on Computational Geometry, pp. 314\u2013320 (2005)","key":"11_CR32","DOI":"10.1145\/1064092.1064140"}],"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_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,24]],"date-time":"2021-04-24T05:35:59Z","timestamp":1619242559000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-58150-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030581497","9783030581503"],"references-count":32,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-58150-3_11","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)"}}]}}