{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T21:45:23Z","timestamp":1769982323560,"version":"3.49.0"},"reference-count":12,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"12","license":[{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[1981,12,1]],"date-time":"1981-12-01T00:00:00Z","timestamp":376012800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[1981,12]]},"DOI":"10.1109\/tc.1981.1675729","type":"journal-article","created":{"date-parts":[[2007,9,4]],"date-time":"2007-09-04T16:35:10Z","timestamp":1188923710000},"page":"910-914","source":"Crossref","is-referenced-by-count":120,"title":["An Optimal Algorithm for Determining the Visibility of a Polygon from an Edge"],"prefix":"10.1109","volume":"C-30","author":[{"family":"Avis","sequence":"first","affiliation":[{"name":"School of Computer Science, McGill University"}]},{"family":"Toussaint","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref4","author":"shamos","year":"1977","journal-title":"Problems in computational geometry"},{"key":"ref3","first-page":"509","article-title":"a mobile automaton: an application of artificial intelligence techniques","author":"nilsson","year":"1969","journal-title":"Proc IJCAI"},{"key":"ref10","author":"toussaint","year":"0","journal-title":"A hierarchy of simple polygons"},{"key":"ref6","doi-asserted-by":"crossref","first-page":"917","DOI":"10.1090\/S0002-9939-1953-0058996-7","article-title":"minimal sets of visibility","volume":"4","author":"valentine","year":"1953","journal-title":"Proc Amer Math Soc"},{"key":"ref11","article-title":"a linear algorithm for determining the visibility polygon from a point","author":"gindy","year":"1981","journal-title":"J Algorithms"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/322139.322142"},{"key":"ref12","article-title":"pattern recognition and geometrical complexity","author":"toussaint","year":"1980","journal-title":"Proc 5th Int Conf Pattern Recog"},{"key":"ref8","author":"valentine","year":"1964","journal-title":"Convex Sets"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.2140\/pjm.1976.64.333"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/0146-664X(79)90076-5"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(75)90061-1"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/PGEC.1967.264724"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/12\/35200\/01675729.pdf?arnumber=1675729","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,17]],"date-time":"2025-07-17T17:56:32Z","timestamp":1752774992000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/1675729\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981,12]]},"references-count":12,"journal-issue":{"issue":"12"},"URL":"https:\/\/doi.org\/10.1109\/tc.1981.1675729","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"value":"0018-9340","type":"print"},{"value":"1557-9956","type":"electronic"},{"value":"2326-3814","type":"electronic"}],"subject":[],"published":{"date-parts":[[1981,12]]}}}