{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,15]],"date-time":"2024-09-15T14:09:51Z","timestamp":1726409391599},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319426334"},{"type":"electronic","value":"9783319426341"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-319-42634-1_17","type":"book-chapter","created":{"date-parts":[[2016,7,19]],"date-time":"2016-07-19T11:50:21Z","timestamp":1468929021000},"page":"209-221","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Constant-Factor Approximation Algorithm for Planar Visibility Counting Problem"],"prefix":"10.1007","author":[{"given":"Sharareh","family":"Alipour","sequence":"first","affiliation":[]},{"given":"Mohammad","family":"Ghodsi","sequence":"additional","affiliation":[]},{"given":"Amir","family":"Jafari","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,20]]},"reference":[{"key":"17_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1007\/978-3-642-21204-8_36","volume-title":"Frontiers in Algorithmics and Algorithmic Aspects in Information and Management","author":"S Alipour","year":"2011","unstructured":"Alipour, S., Zarei, A.: Visibility testing and counting. In: Atallah, M., Li, X.-Y., Zhu, B. (eds.) FAW-AAIM 2011. LNCS, vol. 6681, pp. 343\u2013351. Springer, Heidelberg (2011)"},{"key":"17_CR2","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, 461\u2013483 (2002)","journal-title":"Discret. Comput. Geom."},{"issue":"9","key":"17_CR3","first-page":"557","volume":"68","author":"T Asano","year":"1985","unstructured":"Asano, T.: An efficient algorithm for finding the visibility polygon for a polygonal region with holes. IEICE Trans. 68(9), 557\u2013589 (1985)","journal-title":"IEICE Trans."},{"issue":"7","key":"17_CR4","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. Theory Appl. 23(7), 313\u2013335 (2002)","journal-title":"Comput. Geom. Theory Appl."},{"key":"17_CR5","unstructured":"Fischer, M., Hilbig, M., Jahn, C., Meyer auf der Heide F., Ziegler M.: Planar visibility counting. CoRR, abs\/0810.0052 (2008)"},{"key":"17_CR6","unstructured":"Fischer, M., Hilbig, M., Jahn, C., Meyer auf der Heide F., Ziegler M.: Planar visibility counting. In: Proceedings of the 25th European Workshop on Computational Geometry (EuroCG 2009), pp. 203\u2013206 (2009)"},{"key":"17_CR7","doi-asserted-by":"crossref","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"SK Ghosh","year":"1991","unstructured":"Ghosh, S.K., Mount, D.: An output sensitive algorithm for computing visibility graphs. SIAM J. Comput. 20, 888\u2013910 (1991)","journal-title":"SIAM J. Comput."},{"key":"17_CR8","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, Cambridge (2007)"},{"key":"17_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"},{"issue":"1","key":"17_CR10","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"17_CR11","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1016\/j.comgeo.2012.10.004","volume":"46","author":"M Nouri","year":"2013","unstructured":"Nouri, M., Ghodsi, M.: Space\/query-time tradeoff for computing the visibility polygon. Comput. Geom. 46(3), 371\u2013381 (2013)","journal-title":"Comput. Geom."},{"issue":"3","key":"17_CR12","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1142\/S0218195996000204","volume":"6","author":"M Pocchiola","year":"1996","unstructured":"Pocchiola, M., Vegter, G.: The visibility complex. Int. J. Comput. Geom. Appl. 6(3), 279\u2013308 (1996)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"17_CR13","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 86), pp. 14\u201323 (1986)","DOI":"10.1145\/10515.10517"},{"key":"17_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/3-540-52846-6_81","volume-title":"SWAT 90","author":"G Vegter","year":"1990","unstructured":"Vegter, G.: The visibility diagram: a data structure for visibility problems and motion planning. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 90. LNCS, vol. 447, pp. 97\u2013110. Springer, Heidelberg (1990)"},{"key":"17_CR15","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","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-42634-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T14:44:13Z","timestamp":1498315453000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-42634-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319426334","9783319426341"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-42634-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}