{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T17:42:49Z","timestamp":1649180569610},"reference-count":15,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[2002,4,1]],"date-time":"2002-04-01T00:00:00Z","timestamp":1017619200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":4125,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,4]]},"DOI":"10.1016\/s0304-3975(01)00208-0","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T19:52:16Z","timestamp":1027626736000},"page":"417-424","source":"Crossref","is-referenced-by-count":0,"title":["A necessary condition for a graph to be the visibility graph of a simple polygon"],"prefix":"10.1016","volume":"276","author":[{"given":"Chiuyuan","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00208-0_BIB1","first-page":"119","article-title":"On visibility graphs of simple polygons","volume":"90","author":"Abello","year":"1992","journal-title":"Congr. Numer."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB2","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1016\/0166-218X(92)90018-6","article-title":"Some results on visibility graphs","volume":"40","author":"Andreae","year":"1992","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB3","series-title":"Graph Theory with Applications","author":"Bondy","year":"1976"},{"issue":"4","key":"10.1016\/S0304-3975(01)00208-0_BIB4","doi-asserted-by":"crossref","first-page":"349","DOI":"10.1142\/S0218195992000202","article-title":"Distance visibility graphs","volume":"2","author":"Coullard","year":"1992","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB5","unstructured":"H. ElGindy, Hierarchical decomposition of polygon with applications, Ph.D. Thesis, School of Computer Science, McGill University, Montreal, Quebec, 1985."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB6","unstructured":"H. Everett, Visibility graphs of recognition, Ph.D. Thesis, University of Toronto, Toronto, Ontario, 1990."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0196-6774(90)90026-B","article-title":"Recognizing visibility graphs of spiral polygons","volume":"11","author":"Everett","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0304-3975(01)00208-0_BIB8","unstructured":"S.K. Ghosh, On recognizing and characterizing visibility graphs of simple polygons, Report JHU\/EECS-86\/14, Department of Electrical Engineering and Computer Science, The Johns Hopkins University, Baltimore, MD, 1986."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB9","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0012-365X(87)90190-7","article-title":"A note on visibility graphs","volume":"64","author":"Luccio","year":"1987","journal-title":"Discrete Math."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB10","series-title":"Art Gallery Theorems and Algorithms","author":"O'Rourke","year":"1987"},{"issue":"1","key":"10.1016\/S0304-3975(01)00208-0_BIB11","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1142\/S0218195993000075","article-title":"Computational geometry column 18","volume":"3","author":"O'Rourke","year":"1993","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB12","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1016\/0925-7721(94)90019-1","article-title":"Two segment classes with Hamiltonian visibility graphs","volume":"4","author":"O'Rourke","year":"1994","journal-title":"Comput. Geom. Theory Appl."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB13","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0020-0190(93)90205-N","article-title":"A note on minimal visibility graphs","volume":"46","author":"Shen","year":"1993","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0304-3975(01)00208-0_BIB14","doi-asserted-by":"crossref","first-page":"1384","DOI":"10.1109\/5.163407","article-title":"Recent results in art galleries","volume":"80","author":"Shermer","year":"1992","journal-title":"Proc. IEEE"},{"key":"10.1016\/S0304-3975(01)00208-0_BIB15","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/BF02574366","article-title":"A new necessary condition for the vertex visibility graphs of simple polygons","volume":"12","author":"Srinivasaraghavan","year":"1994","journal-title":"Discrete Comput. Geom."}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002080?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002080?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,22]],"date-time":"2019-04-22T05:25:29Z","timestamp":1555910729000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002080"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,4]]},"references-count":15,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2002,4]]}},"alternative-id":["S0304397501002080"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00208-0","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[2002,4]]}}}