{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:24:48Z","timestamp":1759638288980,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":18,"publisher":"ACM","license":[{"start":{"date-parts":[[2010,6,13]],"date-time":"2010-06-13T00:00:00Z","timestamp":1276387200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2010,6,13]]},"DOI":"10.1145\/1810959.1810973","type":"proceedings-article","created":{"date-parts":[[2010,6,15]],"date-time":"2010-06-15T13:11:04Z","timestamp":1276607464000},"page":"77-86","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Planar visibility"],"prefix":"10.1145","author":[{"given":"Joachim","family":"Gudmundsson","sequence":"first","affiliation":[{"name":"NICTA, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Pat","family":"Morin","sequence":"additional","affiliation":[{"name":"Carleton University, Ottawa, ON, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2010,6,13]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Contemporary Mathematics","first-page":"1","volume-title":"Advances in Discrete and Computational Geometry","author":"Agarwal P. K.","year":"1999","unstructured":"P. K. Agarwal and J. Erickson . Geometric range searching and its relatives . In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry , volume 223 of Contemporary Mathematics , pages 1 -- 56 . American Mathematical Society Press , 1999 . P. K. Agarwal and J. Erickson. Geometric range searching and its relatives. In B. Chazelle, J. E. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics, pages 1--56. American Mathematical Society Press, 1999."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-001-0089-9"},{"key":"e_1_3_2_1_3_1","volume-title":"E68-E:557--589","author":"Asano T.","year":"1985","unstructured":"T. Asano . An efficient algorithm for finding the visibility polygon for a polygonal region with holes. IEICE Transactions , E68-E:557--589 , 1985 . T. Asano. An efficient algorithm for finding the visibility polygon for a polygonal region with holes. IEICE Transactions, E68-E:557--589, 1985."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0925-7721(01)00070-0"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/PL00009478"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry Algorithms and Applications","author":"de Berg M.","year":"2008","unstructured":"M. de Berg , O. Cheong , M. van Kreveld , and M. Overmars . Computational Geometry Algorithms and Applications . Springer , third edition, 2008 . M. de Berg, O. Cheong, M. van Kreveld, and M. Overmars. Computational Geometry Algorithms and Applications. Springer, third edition, 2008."},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02712875"},{"key":"e_1_3_2_1_8_1","first-page":"1999","article-title":"Lower bounds for linear satisfiability problems","author":"Erickson J.","year":"1999","unstructured":"J. Erickson . Lower bounds for linear satisfiability problems . Chicago Journal of Theoretical Computer Science , 1999 , 1999 . J. Erickson. Lower bounds for linear satisfiability problems. Chicago Journal of Theoretical Computer Science, 1999, 1999.","journal-title":"Chicago Journal of Theoretical Computer Science"},{"key":"e_1_3_2_1_9_1","volume-title":"Meyer auf der Heide, and M. Ziegler. Planar visibility counting. CoRR, abs\/0810.0052","author":"Fischer M.","year":"2008","unstructured":"M. Fischer , M. Hilbig , C. Jahn , F. Meyer auf der Heide, and M. Ziegler. Planar visibility counting. CoRR, abs\/0810.0052 , 2008 . M. Fischer, M. Hilbig, C. Jahn, F. Meyer auf der Heide, and M. Ziegler. Planar visibility counting. CoRR, abs\/0810.0052, 2008."},{"key":"e_1_3_2_1_10_1","first-page":"203","volume-title":"Proceedings of the 25th European Workshop on Computational Geometry (EuroCG 2009","author":"Fischer M.","year":"2009","unstructured":"M. Fischer , M. Hilbig , C. Jahn , F. Meyer auf der Heide, and M. Ziegler. Planar visibility counting . In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG 2009 ), pages 203 -- 206 , 2009 . M. Fischer, M. Hilbig, C. Jahn, F. Meyer auf der Heide, and M. Ziegler. Planar visibility counting. In Proceedings of the 25th European Workshop on Computational Geometry (EuroCG 2009), pages 203--206, 2009."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220055"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792233257"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02293051"},{"key":"e_1_3_2_1_14_1","series-title":"Springer Graduate Texts in Mathematic","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","volume-title":"Lectures on Discrete Geometry","author":"Matousek J.","year":"2002","unstructured":"J. Matousek . Lectures on Discrete Geometry , volume 212 of Springer Graduate Texts in Mathematic . Springer , 2002 . J. Matousek. Lectures on Discrete Geometry, volume 212 of Springer Graduate Texts in Mathematic. Springer, 2002."},{"key":"e_1_3_2_1_15_1","volume-title":"Art Gallery Theorems and Applications","author":"O'Rourke J.","year":"1987","unstructured":"J. O'Rourke . Art Gallery Theorems and Applications . Oxford University Press , 1987 . J. O'Rourke. Art Gallery Theorems and Applications. Oxford University Press, 1987."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1142\/S0218195996000204"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/10515.10517"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1064092.1064140"}],"event":{"name":"SoCG '10: Symposium on Computational Geometry","sponsor":["SIGGRAPH ACM Special Interest Group on Computer Graphics and Interactive Techniques","SIGACT ACM Special Interest Group on Algorithms and Computation Theory"],"location":"Snowbird Utah USA","acronym":"SoCG '10"},"container-title":["Proceedings of the twenty-sixth annual symposium on Computational geometry"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1810973","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1810959.1810973","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T11:23:01Z","timestamp":1750245781000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1810959.1810973"}},"subtitle":["testing and counting"],"short-title":[],"issued":{"date-parts":[[2010,6,13]]},"references-count":18,"alternative-id":["10.1145\/1810959.1810973","10.1145\/1810959"],"URL":"https:\/\/doi.org\/10.1145\/1810959.1810973","relation":{},"subject":[],"published":{"date-parts":[[2010,6,13]]},"assertion":[{"value":"2010-06-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}