{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:34:01Z","timestamp":1725770041000},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319046563"},{"type":"electronic","value":"9783319046570"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04657-0_17","type":"book-chapter","created":{"date-parts":[[2014,1,17]],"date-time":"2014-01-17T05:19:32Z","timestamp":1389935972000},"page":"163-175","source":"Crossref","is-referenced-by-count":1,"title":["Some Results on Point Visibility Graphs"],"prefix":"10.1007","author":[{"given":"Subir Kumar","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"Bodhayan","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"17_CR1","doi-asserted-by":"publisher","first-page":"241","DOI":"10.7155\/jgaa.00091","volume":"8","author":"J.M. Boyer","year":"2004","unstructured":"Boyer, J.M., Myrvold, W.J.: On the Cutting Edge: Simplified O(n) Planarity by Edge Addition. Journal of Graph Algorithms and Applications\u00a08(3), 241\u2013273 (2004)","journal-title":"Journal of Graph Algorithms and Applications"},{"key":"17_CR2","doi-asserted-by":"crossref","unstructured":"Canny, J.: Some algebraic and geometric computations in PSPACE. In: Proceedings of the 20th Annual ACM Symposium on Theory of Computing, pp. 460\u2013467 (1988)","DOI":"10.1145\/62212.62257"},{"key":"17_CR3","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1007\/BF01934990","volume":"25","author":"B. Chazelle","year":"1985","unstructured":"Chazelle, B., Guibas, L.J., Lee, D.T.: The power of geometric duality. BIT\u00a025, 76\u201390 (1985)","journal-title":"BIT"},{"key":"17_CR4","doi-asserted-by":"crossref","unstructured":"de Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry, Algorithms and Applications, 3rd edn. Springer (2008)","DOI":"10.1007\/978-3-540-77974-2"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Dujmovic, V., Eppstein, D., Suderman, M., Wood, D.R.: Drawings of planar graphs with few slopes and segments. In: Computational Geometry Theory and Applications, pp. 194\u2013212 (2007)","DOI":"10.1016\/j.comgeo.2006.09.002"},{"key":"17_CR6","doi-asserted-by":"publisher","first-page":"341","DOI":"10.1137\/0215024","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"Edelsbrunner, H., O\u2019Rourke, J., Seidel, R.: Constructing arrangements of lines and hyperplanes with applications. SIAM Journal on Computing\u00a015, 341\u2013363 (1986)","journal-title":"SIAM Journal on Computing"},{"key":"17_CR7","unstructured":"Everett, H.: Visibility Graph Recognition. Ph. D. Thesis, University of Toronto, Toronto (January 1990)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press (2007)","DOI":"10.1017\/CBO9780511543340"},{"issue":"2","key":"17_CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2543581.2543589","volume":"46","author":"S.K. Ghosh","year":"2014","unstructured":"Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graphs of points, segments and polygons. ACM Computing Surveys\u00a046(2), 22:1\u201322:29 (2014)","journal-title":"ACM Computing Surveys"},{"key":"17_CR10","unstructured":"Ghosh, S.K., Roy, B.: Some results on point visibility graphs. arXiv:1209.2308 (September 2012)"},{"issue":"3","key":"17_CR11","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s00454-005-1177-z","volume":"34","author":"J. K\u00e1ra","year":"2005","unstructured":"K\u00e1ra, J., P\u00f3r, A., Wood, D.R.: On the Chromatic Number of the Visibility Graph of a Set of Points in the Plane. Discrete & Computational Geometry\u00a034(3), 497\u2013506 (2005)","journal-title":"Discrete & Computational Geometry"},{"key":"17_CR12","doi-asserted-by":"publisher","first-page":"560","DOI":"10.1145\/359156.359164","volume":"22","author":"T. Lozano-Perez","year":"1979","unstructured":"Lozano-Perez, T., Wesley, M.A.: An algorithm for planning collision-free paths among polyhedral obstacles. Communications of ACM\u00a022, 560\u2013570 (1979)","journal-title":"Communications of ACM"},{"issue":"3","key":"17_CR13","doi-asserted-by":"publisher","first-page":"669","DOI":"10.1007\/s00454-012-9446-0","volume":"48","author":"M.S. Payne","year":"2012","unstructured":"Payne, M.S., P\u00f3r, A., Valtr, P., Wood, D.R.: On the connectivity of visibility graphs. Discrete & Computational Geometry\u00a048(3), 669\u2013681 (2012)","journal-title":"Discrete & Computational Geometry"},{"key":"17_CR14","unstructured":"Payne, M.S., P\u00f3r, A., Valtr, P., Wood, D.R.: On the connectivity of visibility graphs. arXiv:1106.3622v1 (June 2011)"},{"key":"17_CR15","unstructured":"Roy, B.: Recognizing point visibility graphs. Graduate School Project Report, Tata Institute of Fundamental Research (May 2011)"},{"key":"17_CR16","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1109\/TPAMI.1979.4766871","volume":"PAMI-1","author":"L.G. Shapiro","year":"1979","unstructured":"Shapiro, L.G., Haralick, R.M.: Decomposition of two-dimensional shape by graph-theoretic clustering. IEEE Transactions on Pattern Analysis and Machine Intelligence\u00a0PAMI-1, 10\u201319 (1979)","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-04657-0_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,25]],"date-time":"2019-05-25T23:36:25Z","timestamp":1558827385000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04657-0_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319046563","9783319046570"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04657-0_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}