{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:45Z","timestamp":1725879705079},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_19","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T05:13:23Z","timestamp":1486012403000},"page":"205-218","source":"Crossref","is-referenced-by-count":6,"title":["Incremental Algorithms to Update Visibility Polygons"],"prefix":"10.1007","author":[{"given":"R.","family":"Inkulu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nitish P.","family":"Thakur","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"issue":"4","key":"19_CR1","doi-asserted-by":"crossref","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. Discret. Comput. Geom. 27(4), 461\u2013483 (2002)","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"19_CR2","doi-asserted-by":"crossref","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)","journal-title":"Algorithmica"},{"issue":"3","key":"19_CR3","doi-asserted-by":"crossref","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."},{"key":"19_CR4","doi-asserted-by":"crossref","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B Chazelle","year":"1989","unstructured":"Chazelle, B., Guibas, L.J.: Visibility and intersection problems in plane geometry. Discret. Comput. Geom. 4, 551\u2013581 (1989)","journal-title":"Discret. Comput. Geom."},{"issue":"2","key":"19_CR5","doi-asserted-by":"crossref","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."},{"issue":"6","key":"19_CR6","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1016\/j.comgeo.2015.02.001","volume":"48","author":"DZ Chen","year":"2015","unstructured":"Chen, D.Z., Wang, H.: Weak visibility queries of line segments in simple polygons. Comput. Geom. 48(6), 443\u2013452 (2015)","journal-title":"Comput. Geom."},{"issue":"1","key":"19_CR7","doi-asserted-by":"crossref","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 Proces. 11(1), 49\u201372 (1979)","journal-title":"Comput. Graph. Image Proces."},{"issue":"2","key":"19_CR8","doi-asserted-by":"crossref","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":"19_CR9","doi-asserted-by":"crossref","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":"19_CR10","doi-asserted-by":"crossref","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":"19_CR11","doi-asserted-by":"crossref","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."},{"key":"19_CR12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"LJ Guibas","year":"1987","unstructured":"Guibas, L.J., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.E.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica 2, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"4","key":"19_CR13","doi-asserted-by":"crossref","first-page":"1120","DOI":"10.1137\/S0097539792233257","volume":"26","author":"LJ Guibas","year":"1997","unstructured":"Guibas, L.J., Motwani, R., Raghavan, P.: The robot localization problem. SIAM J. Comput. 26(4), 1120\u20131138 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"19_CR14","doi-asserted-by":"crossref","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":"19_CR15","doi-asserted-by":"crossref","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."},{"issue":"4","key":"19_CR16","doi-asserted-by":"crossref","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)","journal-title":"BIT Numer. Math."},{"key":"19_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1007\/3-540-62034-6_43","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"S Kapoor","year":"1996","unstructured":"Kapoor, S., Singh, T.: Dynamic maintenance of shortest path trees in simple polygons. In: Chandru, V., Vinay, V. (eds.) FSTTCS 1996. LNCS, vol. 1180, pp. 123\u2013134. Springer, Heidelberg (1996). doi: 10.1007\/3-540-62034-6_43"},{"issue":"2","key":"19_CR18","doi-asserted-by":"crossref","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 Proces. 22(2), 207\u2013221 (1983)","journal-title":"Comput. Vis. Graph. Image Proces."},{"issue":"1","key":"19_CR19","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0734-189X(86)90044-7","volume":"34","author":"DT Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Computing the visibility polygon from an edge. Comput. Vis. Graph. Image Proces. 34(1), 1\u201319 (1986)","journal-title":"Comput. Vis. Graph. Image Proces."},{"key":"19_CR20","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press Inc., New York (1987)"},{"key":"19_CR21","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)","DOI":"10.1145\/10515.10517"},{"key":"19_CR22","doi-asserted-by":"crossref","DOI":"10.1137\/1.9781611970265","volume-title":"Data Structures and Network Algorithms","author":"RE Tarjan","year":"1983","unstructured":"Tarjan, R.E.: Data Structures and Network Algorithms. Society for Industrial and Applied Mathematics, Philadelphia (1983)"},{"key":"19_CR23","doi-asserted-by":"crossref","unstructured":"Vegter, G.: The visibility diagram: a data structure for visibility problems and motion planning. In: Proceedings of Scandinavian Workshop on Algorithm Theory, pp. 97\u2013110 (1990)","DOI":"10.1007\/3-540-52846-6_81"},{"key":"19_CR24","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, Pisa, Italy, 6\u20138 June 2005, pp. 314\u2013320 (2005)","DOI":"10.1145\/1064092.1064140"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,25]],"date-time":"2017-06-25T05:35:22Z","timestamp":1498368922000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53007-9_19","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}