{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T20:21:30Z","timestamp":1725740490872},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642401039"},{"type":"electronic","value":"9783642401046"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40104-6_22","type":"book-chapter","created":{"date-parts":[[2013,7,11]],"date-time":"2013-07-11T01:36:30Z","timestamp":1373506590000},"page":"244-255","source":"Crossref","is-referenced-by-count":2,"title":["Visibility and Ray Shooting Queries in Polygonal Domains"],"prefix":"10.1007","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1006\/jagm.1996.0056","volume":"21","author":"P. Agarwal","year":"1996","unstructured":"Agarwal, P., Sharir, M.: Ray shooting amidst convex polygons in 2D. Journal of Algorithms\u00a021(3), 508\u2013519 (1996)","journal-title":"Journal of Algorithms"},{"issue":"4","key":"22_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., Teichmann, M., Zhang, L.: Visibility queries and maintenance in simple polygons. Discrete and Computational Geometry\u00a027(4), 461\u2013483 (2002)","journal-title":"Discrete and Computational Geometry"},{"issue":"4","key":"22_CR3","doi-asserted-by":"publisher","first-page":"475","DOI":"10.1142\/S0218195994000252","volume":"4","author":"R. Bar-Yehuda","year":"1994","unstructured":"Bar-Yehuda, R., Chazelle, B.: Triangulating disjoint Jordan chains. International Journal of Computational Geometry and Applications\u00a04(4), 475\u2013481 (1994)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"3","key":"22_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.: Efficient visibility queries in simple polygons. Computational Geometry: Theory and Applications\u00a023(3), 313\u2013335 (2002)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"1","key":"22_CR5","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/BF01377183","volume":"12","author":"B. Chazelle","year":"1994","unstructured":"Chazelle, B., Edelsbrunner, H., Grigni, M., Gribas, L., Hershberger, J., Sharir, M., Snoeyink, J.: Ray shooting in polygons using geodesic triangulations. Algorithmica\u00a012(1), 54\u201368 (1994)","journal-title":"Algorithmica"},{"key":"22_CR6","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1007\/BF02187747","volume":"4","author":"B. Chazelle","year":"1989","unstructured":"Chazelle, B., Guibas, L.: Visibility and intersection problems in plane geometry. Discrete and Computational Geometry\u00a04, 551\u2013589 (1989)","journal-title":"Discrete and Computational Geometry"},{"key":"22_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-642-23719-5_41","volume-title":"Algorithms \u2013 ESA 2011","author":"D.Z. Chen","year":"2011","unstructured":"Chen, D.Z., Wang, H.: A nearly optimal algorithm for finding L\n                1 shortest paths among polygonal obstacles in the plane. In: Demetrescu, C., Halld\u00f3rsson, M.M. (eds.) ESA 2011. LNCS, vol.\u00a06942, pp. 481\u2013492. Springer, Heidelberg (2011)"},{"key":"22_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/978-3-642-31594-7_19","volume-title":"Automata, Languages, and Programming","author":"D.Z. Chen","year":"2012","unstructured":"Chen, D.Z., Wang, H.: Computing the visibility polygon of an island in a polygonal domain. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012, Part I. LNCS, vol.\u00a07391, pp. 218\u2013229. Springer, Heidelberg (2012)"},{"issue":"1-4","key":"22_CR9","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(1-4), 209\u2013233 (1987)","journal-title":"Algorithmica"},{"issue":"3","key":"22_CR10","doi-asserted-by":"publisher","first-page":"403","DOI":"10.1006\/jagm.1995.1017","volume":"18","author":"J. Hershberger","year":"1995","unstructured":"Hershberger, J., Suri, S.: A pedestrian approach to ray shooting: Shoot a ray, take a walk. Journal of Algorithms\u00a018(3), 403\u2013431 (1995)","journal-title":"Journal of Algorithms"},{"issue":"9","key":"22_CR11","doi-asserted-by":"publisher","first-page":"873","DOI":"10.1016\/j.comgeo.2009.02.005","volume":"42","author":"R. Inkulu","year":"2009","unstructured":"Inkulu, R., Kapoor, S.: Planar rectilinear shortest path computation using corridors. Computational Geometry: Theory and Applications\u00a042(9), 873\u2013884 (2009)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"9","key":"22_CR12","doi-asserted-by":"publisher","first-page":"852","DOI":"10.1016\/j.comgeo.2009.02.004","volume":"42","author":"R. Inkulu","year":"2009","unstructured":"Inkulu, R., Kapoor, S.: Visibility queries in a polygonal region. Computational Geometry: Theory and Applications\u00a042(9), 852\u2013864 (2009)","journal-title":"Computational Geometry: Theory and Applications"},{"issue":"4","key":"22_CR13","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1007\/PL00009323","volume":"18","author":"S. Kapoor","year":"1997","unstructured":"Kapoor, S., Maheshwari, S., Mitchell, J.: An efficient algorithm for Euclidean shortest paths among polygonal obstacles in the plane. Discrete and Computational Geometry\u00a018(4), 377\u2013383 (1997)","journal-title":"Discrete and Computational Geometry"},{"issue":"3","key":"22_CR14","doi-asserted-by":"publisher","first-page":"393","DOI":"10.1002\/net.3230140304","volume":"14","author":"D. Lee","year":"1984","unstructured":"Lee, D., Preparata, F.: Euclidean shortest paths in the presence of rectilinear barriers. Networks\u00a014(3), 393\u2013410 (1984)","journal-title":"Networks"},{"issue":"16","key":"22_CR15","first-page":"4165","volume":"8","author":"L. Lu","year":"2011","unstructured":"Lu, L., Yang, C., Wang, J.: Point visibility computing in polygons with holes. Journal of Information and Computational Science\u00a08(16), 4165\u20134173 (2011)","journal-title":"Journal of Information and Computational Science"},{"key":"22_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"120","DOI":"10.1007\/978-3-642-02270-8_14","volume-title":"Frontiers in Algorithmics","author":"M. Nouri","year":"2009","unstructured":"Nouri, M., Ghodsi, M.: Space\u2013query-time tradeoff for computing the visibility polygon. In: Deng, X., Hopcroft, J.E., Xue, J. (eds.) FAW 2009. LNCS, vol.\u00a05598, pp. 120\u2013131. Springer, Heidelberg (2009)"},{"key":"22_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/3-540-52846-6_80","volume-title":"SWAT \u201990","author":"M. Pocchiola","year":"1990","unstructured":"Pocchiola, M.: Graphics in flatland revisited. In: Gilbert, J.R., Karlsson, R. (eds.) SWAT 1990. LNCS, vol.\u00a0447, pp. 85\u201396. Springer, Heidelberg (1990)"},{"key":"22_CR18","doi-asserted-by":"crossref","unstructured":"Pocchiola, M., Vegter, G.: Pseudo-triangulations: Theory and applications. In: Proc. of the 12th Annual Symposium on Computational Geometry, pp. 291\u2013300 (1996)","DOI":"10.1145\/237218.237398"},{"issue":"4","key":"22_CR19","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1007\/BF02712876","volume":"16","author":"M. Pocchiola","year":"1996","unstructured":"Pocchiola, M., Vegter, G.: Topologically sweeping visibility complexes via pseudotriangulations. Discrete and Computational Geometry\u00a016(4), 419\u2013453 (1996)","journal-title":"Discrete and Computational Geometry"},{"issue":"3","key":"22_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. International Journal of Computational Geometry and Applications\u00a06(3), 279\u2013308 (1996)","journal-title":"International Journal of Computational Geometry and Applications"},{"issue":"2","key":"22_CR21","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. Computational Geometry: Theory and Applications\u00a039(2), 78\u201390 (2008)","journal-title":"Computational Geometry: Theory and Applications"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40104-6_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T14:38:40Z","timestamp":1557931120000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40104-6_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642401039","9783642401046"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40104-6_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}