{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:43:15Z","timestamp":1743079395835,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319286778"},{"type":"electronic","value":"9783319286785"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-28678-5_6","type":"book-chapter","created":{"date-parts":[[2016,1,8]],"date-time":"2016-01-08T10:14:18Z","timestamp":1452248058000},"page":"72-89","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Visibility Graphs of Anchor Polygons"],"prefix":"10.1007","author":[{"given":"Hossein","family":"Boomari","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alireza","family":"Zarei","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,1,9]]},"reference":[{"key":"6_CR1","unstructured":"Everett, H.: Visibility graph recognition, Ph.d. Dissertation, University of Toronto (1990)"},{"issue":"1","key":"6_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0196-6774(90)90026-B","volume":"11","author":"H Everett","year":"1990","unstructured":"Everett, H., Corneil, D.G.: Recognizing visibility graphs of spiral polygons. J. Algorithms 11(1), 1\u201326 (1990)","journal-title":"J. Algorithms"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1016\/0925-7721(95)00033-X","volume":"7","author":"P Colley","year":"1997","unstructured":"Colley, P., Lubiw, A., Spinrad, J.P.: Visibility graphs of towers. Comput. Geom. 7, 161\u2013172 (1997)","journal-title":"Comput. Geom."},{"key":"6_CR4","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3 edn. MIT Press (2009). ISBN 978-0-262-03384-8, pp. I-XIX, 1\u20131292"},{"key":"6_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"96","DOI":"10.1007\/3-540-19487-8_10","volume-title":"SWAT 1988","author":"SK Ghosh","year":"1988","unstructured":"Ghosh, S.K.: On recognizing and characterizing visibility graphs of simple polygons. In: Karlsson, R., Lingas, A. (eds.) SWAT 1988. LNCS, vol. 318, pp. 96\u2013104. Springer, Heidelberg (1988)"},{"issue":"2","key":"6_CR6","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02770871","volume":"17","author":"SK Ghosh","year":"1997","unstructured":"Ghosh, S.K.: On recognizing and characterizing visibility graphs of simple polygons. Discrete Comput. Geom. 17(2), 143\u2013162 (1997)","journal-title":"Discrete Comput. Geom."},{"issue":"3","key":"6_CR7","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/j.comgeo.2004.12.003","volume":"31","author":"I Streinu","year":"2005","unstructured":"Streinu, I.: Non-stretchable pseudo-visibility graphs. Comput. Geom. 31(3), 195\u2013206 (2005)","journal-title":"Comput. Geom."},{"key":"6_CR8","doi-asserted-by":"crossref","unstructured":"Richter-Gebert, J.: Mn\u00ebvs universality theorem revisited. S\u00e9minaire Lotaringien de Combinatoire (1995)","DOI":"10.1007\/BFb0093764"},{"key":"6_CR9","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press (2007). ISBN 0521875749","DOI":"10.1017\/CBO9780511543340"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Teller, S.J., Hanrahan, P.: Global visibility algorithms for illumination computations. In: SIGGRAPH, pp. 239\u2013246 (1993)","DOI":"10.1145\/166117.166148"},{"issue":"5","key":"6_CR11","doi-asserted-by":"publisher","first-page":"864","DOI":"10.1109\/TRO.2005.851359","volume":"21","author":"C Belta","year":"2005","unstructured":"Belta, C., Isler, V., Pappas, G.J.: Discrete abstractions for robot motion planning and control in polygonal environments. IEEE Trans. Robot. 21(5), 864\u2013874 (2005)","journal-title":"IEEE Trans. Robot."},{"issue":"3","key":"6_CR12","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/BF02570710","volume":"14","author":"J Abello","year":"1995","unstructured":"Abello, J., Egecioglu, \u00d6., Kumar, K.: Visibility graphs of staircase polygons and the weak Bruhat order, I: from visibility graphs to maximal chains. Discrete Comput. Geom. 14(3), 331\u2013358 (1995)","journal-title":"Discrete Comput. Geom."},{"issue":"4","key":"6_CR13","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1142\/S0218195992000202","volume":"2","author":"CR Coullard","year":"1992","unstructured":"Coullard, C.R., Lubiw, A.: Distance visibility graphs. Int. J. Comput. Geom. Appl. 2(4), 349\u2013362 (1992)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"6_CR14","volume-title":"Hierarchical Decomposition of Polygons with Applications","author":"HA Elgindy","year":"1985","unstructured":"Elgindy, H.A.: Hierarchical Decomposition of Polygons with Applications. McGill University, Quebec (1985)"},{"key":"6_CR15","first-page":"119","volume":"90","author":"J Abello","year":"1992","unstructured":"Abello, J., Hua, L., Sekhar, P.: On visibility graphs of simple polygons. Congressus Numerantium 90, 119\u2013128 (1992)","journal-title":"Congressus Numerantium"},{"key":"6_CR16","series-title":"Lecture Notes in Computer Science","first-page":"1","volume-title":"LATIN 1995: Theoretical Informatics","author":"J Abello","year":"1995","unstructured":"Abello, J., Kumar, K.: Visibility graphs of 2-spiral polygons (extended abstract). In: Baeza-Yates, R., Poblete, P.V., Goles, E. (eds.) LATIN 1995. LNCS, vol. 911, pp. 1\u201315. Springer, Heidelberg (1995)"},{"key":"6_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/3-540-58950-3_366","volume-title":"Graph Drawing","author":"J Abello","year":"1995","unstructured":"Abello, J., Kumar, K.: Visibility graphs and oriented matroids (extended abstract). In: Tamassia, R., Tollis, I.G. (eds.) GD 1994. LNCS, vol. 894, pp. 147\u2013158. Springer, Heidelberg (1995)"}],"container-title":["Lecture Notes in Computer Science","Topics in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-28678-5_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,7]],"date-time":"2020-01-07T20:05:19Z","timestamp":1578427519000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-28678-5_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319286778","9783319286785"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-28678-5_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"9 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}