{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:22:44Z","timestamp":1759638164040,"version":"3.38.0"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_36","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T05:15:25Z","timestamp":1306559725000},"page":"343-351","source":"Crossref","is-referenced-by-count":3,"title":["Visibility Testing and Counting"],"prefix":"10.1007","author":[{"given":"Sharareh","family":"Alipour","sequence":"first","affiliation":[]},{"given":"Alireza","family":"Zarei","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"36_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/conm\/223\/03131","volume-title":"Advances in Discrete and Compu- tational Geometry, Contemporary Mathematics","author":"P.K. Agarwal","year":"1999","unstructured":"Agarwal, P.K., Erickson, J.: Geometric range searching and its relatives. In: Chazelle, B., Goodman, J.E., Pollack, R. (eds.) Advances in Discrete and Compu- tational Geometry, Contemporary Mathematics, vol.\u00a0223, pp. 1\u201356. American Mathematical Society Press, Providence (1999)"},{"key":"36_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 and Computational Geometry\u00a027, 461\u2013483 (2002)","journal-title":"Discrete and Computational Geometry"},{"key":"36_CR3","unstructured":"Asano, T.: An efficient algorithm for finding the visibility polygon for a polygonal region with holes. IEICE Transactions, 557\u2013589 (1985)"},{"issue":"7","key":"36_CR4","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.: Eficient visibility queries in simple polygons. Computational Geometry Theory and Applications\u00a023(7), 313\u2013335 (2002)","journal-title":"Computational Geometry Theory and Applications"},{"key":"36_CR5","unstructured":"Fischer, M., Hilbig, M., Jahn, C., auf der Heide, F.M., Ziegler, M.: Planar visibility counting. CoRR, abs\/0810.0052 (2008)"},{"key":"36_CR6","unstructured":"Fischer, M., Hilbig, M., Jahn, C., auf der Heide, F.M, and Ziegler, M.: Planar visibility counting. In: Proceedings of the 25th European Workshop on Computational Geometry(EuroCG 2009), pp. 203\u2013206 (2009)"},{"key":"36_CR7","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"S.K. Ghosh","year":"1991","unstructured":"Ghosh, S.K., Mount, D.: An output sensitive algorithm for computing visibility graphs. SIAM Journal on Computing\u00a020, 888\u2013910 (1991)","journal-title":"SIAM Journal on Computing"},{"key":"36_CR8","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility algorithms in the plane","author":"S.K. Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility algorithms in the plane. Cambridge University Press, Cambridge (2007)"},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Morin, P.: Planar visibility: testing and counting. In: Annual Symposium on Computational Geometry, pp. 77\u201386 (2010)","DOI":"10.1145\/1810959.1810973"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"315","DOI":"10.1007\/BF02293051","volume":"8","author":"J. Matoutsek","year":"1992","unstructured":"Matoutsek, J.: Effcient partition trees. Discrete and Computational Geometry\u00a08, 315\u2013334 (1992)","journal-title":"Discrete and Computational Geometry"},{"issue":"3","key":"36_CR11","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1142\/S0218195996000204","volume":"6","author":"M. Pocchiola","year":"1996","unstructured":"Pocchiola, M., Vegter, G.: The visibility complex. International Journal of Computational Geometry and Applications\u00a06(3), 279\u2013308 (1996)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Suri, S., O\u2019Rourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: Proceedings of the Second Annual Symposium on Computational Geometry (SCG 1984), pp. 14\u201323 (1984)","DOI":"10.1145\/10515.10517"},{"key":"36_CR13","doi-asserted-by":"crossref","unstructured":"Zarei, A., Ghodsi, M.: Efficient computation of query point visibility in polygons with holes. In: Proceedings of the 21st Annual ACM Symposium on Computational Geometry (SCG 2005) (2005)","DOI":"10.1145\/1064092.1064140"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,5]],"date-time":"2025-03-05T21:54:45Z","timestamp":1741211685000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}