{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T05:52:09Z","timestamp":1725688329849},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642311543"},{"type":"electronic","value":"9783642311550"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31155-0_1","type":"book-chapter","created":{"date-parts":[[2012,6,13]],"date-time":"2012-06-13T02:21:27Z","timestamp":1339554087000},"page":"1-12","source":"Crossref","is-referenced-by-count":0,"title":["\u03b1-Visibility"],"prefix":"10.1007","author":[{"given":"Mohammad","family":"Ghodsi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anil","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mostafa","family":"Nouri","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J\u00f6rg-R\u00fcdiger","family":"Sack","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamid","family":"Zarrabi-Zadeh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"1_CR1","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., Teichmann, M., Zhang, L.: Visibility queries and maintenance in simple polygons. Discrete Comput. Geom.\u00a027(4), 461\u2013483 (2002)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/BF01840436","volume":"1","author":"T. Asano","year":"1986","unstructured":"Asano, T., Asano, T., Guibas, L., Hershberger, J., Imai, H.: Visibility of disjoint polygons. Algorithmica\u00a01(1), 49\u201363 (1986)","journal-title":"Algorithmica"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Asano, T., Ghosh, S., Shermer, T.: Visibility in Plane in the Handbook in Computational Geometry. Elsevier Science (1999)","DOI":"10.1016\/B978-044482537-7\/50020-6"},{"key":"1_CR4","unstructured":"Bose, P., Lubiw, A., Munro, J.: Efficient visibility queries in simple polygons. In: Proc. 4th Canadian Conf. Comput. Geom., pp. 23\u201328 (1992)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"436","DOI":"10.1007\/BF01456703","volume":"73","author":"H. Brunn","year":"1913","unstructured":"Brunn, H.: \u00dcber Kerneigebiete. Math. Ann.\u00a073, 436\u2013440 (1913)","journal-title":"Math. Ann."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1810959.1810961","volume-title":"Proceedings of the 2010 Annual Symposium on Computational Geometry, SoCG 2010","author":"T.M. Chan","year":"2010","unstructured":"Chan, T.M.: Optimal partition trees. In: Proceedings of the 2010 Annual Symposium on Computational Geometry, SoCG 2010, pp. 1\u201310. ACM, N.Y. (2010)"},{"issue":"2","key":"1_CR7","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1016\/0196-6774(81)90019-5","volume":"2","author":"H.A. ElGindy","year":"1981","unstructured":"ElGindy, H.A., Avis, D.: A linear algorithm for computing the visibility polygon from a point. J. Algorithms\u00a02(2), 186\u2013197 (1981)","journal-title":"J. Algorithms"},{"key":"1_CR8","doi-asserted-by":"crossref","unstructured":"Ghosh, S.: Visibility Algorithms in the Plane. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511543340"},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"888","DOI":"10.1137\/0220055","volume":"20","author":"S. Ghosh","year":"1991","unstructured":"Ghosh, S., Mount, D.: An output-sensitive algorithm for computing visibility. SIAM J. Comput.\u00a020, 888\u2013910 (1991)","journal-title":"SIAM J. Comput."},{"key":"1_CR10","doi-asserted-by":"crossref","unstructured":"Gudmundsson, J., Morin, P.: Planar visibility: testing and counting. In: Proceedings of the 2010 Annual Symposium on Computational Geometry. ACM (2010)","DOI":"10.1145\/1810959.1810973"},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/BF01840360","volume":"2","author":"L. Guibas","year":"1987","unstructured":"Guibas, L., Hershberger, J., Leven, D., Sharir, M., Tarjan, R.: Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons. Algorithmica\u00a02, 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"1120","DOI":"10.1137\/S0097539792233257","volume":"26","author":"L. Guibas","year":"1997","unstructured":"Guibas, L., Motwani, R., Raghavan, P.: The robot localization problem. SIAM J. Comput.\u00a026(4), 1120\u20131138 (1997)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"1_CR13","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1137\/S0097539791221505","volume":"24","author":"P. Heffernan","year":"1995","unstructured":"Heffernan, P., Mitchell, J.: An optimal algorithm for computing visibility in the plane. SIAM J. Comput.\u00a024(1), 184\u2013201 (1995)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"1_CR14","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1142\/S0218195900000309","volume":"10","author":"M. Keil","year":"2000","unstructured":"Keil, M., Mount, D., Wismath, S.: Visibility stabs and depth-first spiralling on line segments in output sensitive time. Int. J. Comput. Geometry Appl.\u00a010(5), 535\u2013552 (2000)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"2","key":"1_CR15","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/0734-189X(83)90065-8","volume":"22","author":"D. Lee","year":"1983","unstructured":"Lee, D.: Visibility of a simple polygon. Computer Vision, Graphics, and Image Processing\u00a022(2), 207\u2013221 (1983)","journal-title":"Computer Vision, Graphics, and Image Processing"},{"key":"1_CR16","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/BF02573972","volume":"10","author":"J. Matou\u0161ek","year":"1993","unstructured":"Matou\u0161ek, J.: Range searching with efficient hierarchical cuttings. Discrete & Computational Geometry\u00a010, 157\u2013182 (1993)","journal-title":"Discrete & Computational Geometry"},{"issue":"4","key":"1_CR17","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0221038","volume":"21","author":"E. Melissaratos","year":"1992","unstructured":"Melissaratos, E., Souvaine, D.: Shortest paths help solve geometric optimization problems in planar regions. SIAM Jl. Computing\u00a021(4), 601\u2013638 (1992)","journal-title":"SIAM Jl. Computing"},{"key":"1_CR18","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1137\/S0097539799364092","volume":"31","author":"J. Munro","year":"2002","unstructured":"Munro, J., Raman, V.: Succinct representation of balanced parentheses and static trees. SIAM J. Comput.\u00a031, 762\u2013776 (2002)","journal-title":"SIAM J. Comput."},{"key":"1_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1007\/978-3-540-74472-6_6","volume-title":"Computational Science and Its Applications \u2013 ICCSA 2007","author":"M. Nouri","year":"2007","unstructured":"Nouri, M., Zarei, A., Ghodsi, M.: Weak Visibility of Two Objects in Planar Polygonal Scenes. In: Gervasi, O., Gavrilova, M.L. (eds.) ICCSA 2007, Part I. LNCS, vol.\u00a04705, pp. 68\u201381. Springer, Heidelberg (2007)"},{"issue":"3","key":"1_CR20","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. Int. J. Comput. Geometry Appl.\u00a06(3), 279\u2013308 (1996)","journal-title":"Int. J. Comput. Geometry Appl."},{"key":"1_CR21","unstructured":"Souvaine, D.: Computational geometry in a curved world (algorithm). PhD thesis. Princeton University, Princeton (1986), AAI8629439"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Suri, S., O\u2019Rourke, J.: Worst-case optimal algorithms for constructing visibility polygons with holes. In: Proceedings of the 1986 Annual Symposium on Computational Geometry, pp. 14\u201323 (1986)","DOI":"10.1145\/10515.10517"},{"key":"1_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/3-540-52846-6_81","volume-title":"SWAT \u201990","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 1990. LNCS, vol.\u00a0447, pp. 97\u2013110. Springer, Heidelberg (1990)"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1016\/j.comgeo.2007.02.005","volume":"39","author":"A. Zarei","year":"2008","unstructured":"Zarei, A., Ghodsi, M.: Query point visibility computation in polygons with holes. Comput. Geom. Theory Appl.\u00a039, 78\u201390 (2008)","journal-title":"Comput. Geom. Theory Appl."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory \u2013 SWAT 2012"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31155-0_1.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T11:48:24Z","timestamp":1620128904000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31155-0_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642311543","9783642311550"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31155-0_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}