{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:25:18Z","timestamp":1759638318142},"publisher-location":"Cham","reference-count":7,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539249"},{"type":"electronic","value":"9783319539256"}],"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-53925-6_4","type":"book-chapter","created":{"date-parts":[[2017,2,19]],"date-time":"2017-02-19T20:12:36Z","timestamp":1487535156000},"page":"42-53","source":"Crossref","is-referenced-by-count":2,"title":["How to Extend Visibility Polygons by Mirrors to Cover Invisible Segments"],"prefix":"10.1007","author":[{"given":"Arash","family":"Vaezi","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,21]]},"reference":[{"key":"4_CR1","unstructured":"Vaezi, A., Ghodsi, M.: Extending visibility polygons by mirrors to cover specific targets. In: EuroCG 2013, pp. 13\u201316 (2013)"},{"key":"4_CR2","doi-asserted-by":"crossref","first-page":"553","DOI":"10.1007\/PL00009368","volume":"19","author":"B Aronov","year":"1998","unstructured":"Aronov, B., Davis, A., Day, T., Pal, S.P., Prasad, D.: Visibility with one reflection. Discrete Comput. Geom. 19, 553\u2013574 (1998)","journal-title":"Discrete Comput. Geom."},{"key":"4_CR3","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","volume":"C\u201330","author":"D Avis","year":"1981","unstructured":"Avis, D., Toussaint, G.T.: An optional algorithm for determining the visibility of a polygon from an edge. IEEE Trans. Comput. C\u201330, 910\u20131014 (1981)","journal-title":"IEEE Trans. Comput."},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"de Berg, M., van Kreveld, M., Overmars, M., Schwarzkopf, O.: Computational Geometry Algorithms and Applications, 3rd edn., pp. 13\u201314. Department of Computer Science Utrecht University (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"4_CR5","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"},{"key":"4_CR6","unstructured":"Kouhestani, B., Asgaripour, M., Mahdavi, S.S., Nouri, A., Mohades, A.: Visibility polygons in the presence of a mirror edge. In: Proceedings of the 26th European Workshop on Computational Geometry, vol. 26, pp. 209\u2013212 (2010)"},{"key":"4_CR7","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 Process. 22, 207\u2013221 (1983)","journal-title":"Comput. Vis. Graph. Image Process."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53925-6_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T13:53:02Z","timestamp":1601646782000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53925-6_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539249","9783319539256"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53925-6_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}