{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,3,29]],"date-time":"2022-03-29T20:37:33Z","timestamp":1648586253628},"reference-count":5,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1991,1,1]],"date-time":"1991-01-01T00:00:00Z","timestamp":662688000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[1991,1]]},"DOI":"10.1016\/0097-8493(91)90024-c","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T23:49:30Z","timestamp":1060300170000},"page":"1-8","source":"Crossref","is-referenced-by-count":5,"title":["Recursive bisection line algorithm"],"prefix":"10.1016","volume":"15","author":[{"given":"John R.","family":"Rankin","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0097-8493(91)90024-C_BIB1","first-page":"22","article-title":"Principles of Interactive Computer Graphics","author":"Newman","year":"1981"},{"issue":"1","key":"10.1016\/0097-8493(91)90024-C_BIB2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1147\/sj.41.0025","article-title":"Algorithm for computer control of a digital plotter","volume":"4","author":"Bresenham","year":"1965","journal-title":"IBM Systems Journal"},{"key":"10.1016\/0097-8493(91)90024-C_BIB3","series-title":"Fundamental Algorithms for Computer Graphics","first-page":"19","article-title":"Theoretical and linguistic methods for describing straight lines","author":"Brons","year":"1985"},{"key":"10.1016\/0097-8493(91)90024-C_BIB4","series-title":"Fundamental Algorithms for Computer Graphics","first-page":"135","article-title":"An application of Euclid's algorithm to drawing straight lines","author":"Castle","year":"1985"},{"key":"10.1016\/0097-8493(91)90024-C_BIB5","series-title":"Fundamental Algorithms for Computer Graphics","first-page":"105","article-title":"The relationship between Euclid's algorithms and run-length encoding","author":"Pitteway","year":"1985"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009784939190024C?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:009784939190024C?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T06:51:30Z","timestamp":1552632690000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/009784939190024C"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,1]]},"references-count":5,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1991,1]]}},"alternative-id":["009784939190024C"],"URL":"https:\/\/doi.org\/10.1016\/0097-8493(91)90024-c","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[1991,1]]}}}