{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,19]],"date-time":"2026-07-19T01:35:37Z","timestamp":1784424937983,"version":"3.55.0"},"reference-count":15,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1998,3,1]],"date-time":"1998-03-01T00:00:00Z","timestamp":888710400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[1998,7,15]],"date-time":"1998-07-15T00:00:00Z","timestamp":900460800000},"content-version":"vor","delay-in-days":136,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1998,3]]},"DOI":"10.1016\/s0020-0190(97)00211-1","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T13:32:24Z","timestamp":1049722344000},"page":"269-275","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":13,"title":["Maintaining visibility of a polygon with a moving point of view"],"prefix":"10.1016","volume":"65","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ovidiu","family":"Daescu","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(97)00211-1_BIB1","doi-asserted-by":"crossref","first-page":"910","DOI":"10.1109\/TC.1981.1675729","article-title":"An optimal algorithm for determining the visibility polygon from an edge","volume":"30","author":"Avis","year":"1981","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/S0020-0190(97)00211-1_BIB2","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1007\/BF01187019","article-title":"Visibility with a moving point of view","volume":"11","author":"Bern","year":"1994","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB3","doi-asserted-by":"crossref","first-page":"485","DOI":"10.1007\/BF02574703","article-title":"Triangulating a simple polygon in linear time","volume":"6","author":"Chazelle","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(97)00211-1_BIB4","first-page":"51","article-title":"Visibility and intersection problems in plane geometry","volume":"4","author":"Chazell","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0020-0190(97)00211-1_BIB5","first-page":"109","article-title":"Making data structures persistent","volume":"5","author":"Driscoll","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB6","article-title":"Hierarchial decomposition of polygon with applications","author":"ElGindy","year":"1985"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB7","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1007\/BF01840360","article-title":"Linear-time algorithms for visibility and shortest path problems inside triangulated simple polygons","volume":"2","author":"Guibas","year":"1987","journal-title":"Algorithmica"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB8","series-title":"Proc. 6th Ann. ACM Symp. on Computational Geometry","first-page":"53","article-title":"Structured visibility profiles with applications to problems in simple polygons","author":"Heffernan","year":"1990"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0734-189X(86)90044-7","article-title":"Computing the visibility polygon from an edge","volume":"34","author":"Lee","year":"1986","journal-title":"Comput. Vision Graphics Image Process"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB10","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-55706-7_35","article-title":"Maintaining the visibility map of spheres while moving the viewpoint on a circle at infinity","author":"Lenhof","year":"1992"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB11","series-title":"Proc. 23rd ACM Symp. on Theory of Computing","first-page":"512","article-title":"Hidden surface removal with respect to a moving view point","author":"Mulmuley","year":"1991"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB12","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB13","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1145\/6138.6151","article-title":"Planar point location using persistent search trees","volume":"29","author":"Sarnak","year":"1986","journal-title":"Comm. ACM"},{"key":"10.1016\/S0020-0190(97)00211-1_BIB14","doi-asserted-by":"crossref","first-page":"449","DOI":"10.1016\/0167-8655(86)90043-7","article-title":"A linear-time algorithm for solving the strong hidden-line problem in simple polygon","volume":"4","author":"Toussaint","year":"1986","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/S0020-0190(97)00211-1_BIB15","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1137\/0220041","article-title":"Lower bounds for algebraic computation trees with integer inputs","volume":"20","author":"Yao","year":"1991","journal-title":"SIAM J. Comput."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002111?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019097002111?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T02:42:24Z","timestamp":1758076944000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019097002111"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,3]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1998,3]]}},"alternative-id":["S0020019097002111"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(97)00211-1","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1998,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Maintaining visibility of a polygon with a moving point of view","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0020-0190(97)00211-1","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1988 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}