{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:01:39Z","timestamp":1725879699291},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319530062"},{"type":"electronic","value":"9783319530079"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53007-9_14","type":"book-chapter","created":{"date-parts":[[2017,2,2]],"date-time":"2017-02-02T10:13:23Z","timestamp":1486030403000},"page":"156-165","source":"Crossref","is-referenced-by-count":2,"title":["On Colouring Point Visibility Graphs"],"prefix":"10.1007","author":[{"given":"Ajit Arvind","family":"Diwan","sequence":"first","affiliation":[]},{"given":"Bodhayan","family":"Roy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,1,26]]},"reference":[{"key":"14_CR1","unstructured":"Cardinal, J., Hoffmann, U.: Recognition and complexity of point visibility graphs. In: Symposium of Computational Geometry, pp. 171\u2013185 (2015)"},{"key":"14_CR2","doi-asserted-by":"crossref","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 25, 76\u201390 (1985)","journal-title":"BIT"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Cibulka, J., Kyncl, J., Valtr, P.: On planar point sets with the pentagon property. In: Proceedings of the Twenty-Ninth Annual Symposium on Computational Geometry, pp. 81\u201390 (2013)","DOI":"10.1145\/2462356.2462406"},{"key":"14_CR4","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry, Algorithms and Applications","author":"M Berg De","year":"2008","unstructured":"De Berg, M., Cheong, O., Kreveld, M., Overmars, M.: Computational Geometry, Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"key":"14_CR5","unstructured":"Diwan, A.A., Roy, B.: Partitions of planar point sets into polygons. In: Proceedings of the 28th Canadian Conference on Computational Geometry, pp. 147\u2013154 (2016)"},{"key":"14_CR6","doi-asserted-by":"crossref","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 J. Comput. 15, 341\u2013363 (1986)","journal-title":"SIAM J. Comput."},{"volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","year":"1979","author":"MR Garey","key":"14_CR7","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H Freeman and Company, New York (1979)"},{"key":"14_CR8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511543340","volume-title":"Visibility Algorithms in the Plane","author":"SK Ghosh","year":"2007","unstructured":"Ghosh, S.K.: Visibility Algorithms in the Plane. Cambridge University Press, New York (2007)"},{"issue":"2","key":"14_CR9","doi-asserted-by":"crossref","first-page":"22:1","DOI":"10.1145\/2543581.2543589","volume":"46","author":"SK Ghosh","year":"2013","unstructured":"Ghosh, S.K., Goswami, P.P.: Unsolved problems in visibility graphs of points, segments and polygons. ACM Comput. Surv. 46(2), 22:1\u201322:29 (2013)","journal-title":"ACM Comput. Surv."},{"key":"14_CR10","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/j.tcs.2014.10.042","volume":"575","author":"SK Ghosh","year":"2015","unstructured":"Ghosh, S.K., Roy, B.: Some results on point visibility graphs. Theor. Comput. Sci. 575, 17\u201332 (2015)","journal-title":"Theor. Comput. Sci."},{"issue":"3","key":"14_CR11","doi-asserted-by":"crossref","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. Discret. Comput. Geom. 34(3), 497\u2013506 (2005)","journal-title":"Discret. Comput. Geom."},{"key":"14_CR12","doi-asserted-by":"crossref","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. Commun. ACM 22, 560\u2013570 (1979)","journal-title":"Commun. ACM"},{"key":"14_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.4064\/cm-3-2-161-162","volume":"3","author":"J Mycielski","year":"1955","unstructured":"Mycielski, J.: Sur le coloriage des graphes. Colloq. Math. 3, 161\u2013162 (1955)","journal-title":"Colloq. Math."},{"issue":"3","key":"14_CR14","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1007\/s00454-012-9446-0","volume":"48","author":"MS Payne","year":"2012","unstructured":"Payne, M.S., P\u00f3r, A., Valtr, P., Wood, D.R.: On the connectivity of visibility graphs. Discret. Comput. Geom. 48(3), 669\u2013681 (2012)","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"14_CR15","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1007\/s00454-008-9056-z","volume":"39","author":"F Pfender","year":"2008","unstructured":"Pfender, F.: Visibility graphs of point sets in the plane. Discret. Comput. Geom. 39(1), 455\u2013459 (2008)","journal-title":"Discret. Comput. Geom."},{"issue":"1","key":"14_CR16","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218195916500011","volume":"26","author":"B Roy","year":"2016","unstructured":"Roy, B.: Point visibility graph recognition is NP-hard. Int. J. Comput. Geom. Appl. 26(1), 1\u201332 (2016)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"14_CR17","doi-asserted-by":"crossref","unstructured":"Shapiro, L.G., Haralick, R.M.: Decomposition of two-dimensional shape by graph-theoretic clustering. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-1, 10\u201319 (1979)","DOI":"10.1109\/TPAMI.1979.4766871"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Discrete Applied Mathematics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53007-9_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,10,1]],"date-time":"2020-10-01T13:01:04Z","timestamp":1601557264000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53007-9_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319530062","9783319530079"],"references-count":17,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-319-53007-9_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}
