{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,3]],"date-time":"2024-07-03T15:22:23Z","timestamp":1720020143808},"reference-count":37,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2001,8,1]],"date-time":"2001-08-01T00:00:00Z","timestamp":996624000000},"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":[[2001,8]]},"DOI":"10.1016\/s0097-8493(01)00096-6","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T12:35:06Z","timestamp":1027600506000},"page":"681-690","source":"Crossref","is-referenced-by-count":4,"title":["Running the line: Line drawing using runs and runs of runs"],"prefix":"10.1016","volume":"25","author":[{"given":"Peter","family":"Stephenson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bruce","family":"Litow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"1","key":"10.1016\/S0097-8493(01)00096-6_BIB1","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\/S0097-8493(01)00096-6_BIB2","unstructured":"Smith PH, van Rosendale J. Data and visualisation corridors. Report on the 1998 DVC Workshop Series, 1998."},{"issue":"1","key":"10.1016\/S0097-8493(01)00096-6_BIB3","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/38.814569","article-title":"Getting there: The ten top problems left","volume":"20","author":"Foley","year":"2000","journal-title":"IEEE Computer Graphics and Applications"},{"issue":"3","key":"10.1016\/S0097-8493(01)00096-6_BIB4","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/MCG.1984.276064","article-title":"Memory design for raster graphics displays","volume":"4","author":"Whitton","year":"1984","journal-title":"IEEE Computer Graphics and Applications"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB5","unstructured":"Stephenson PD. The structure of the digitised line: with applications to line drawing and ray tracing in computer graphics. PhD Thesis, James Cook University, May 1998."},{"issue":"6","key":"10.1016\/S0097-8493(01)00096-6_BIB6","doi-asserted-by":"crossref","first-page":"76","DOI":"10.1109\/38.888021","article-title":"Why step when you can run: iterative line digitization algorithms based on hierarchies of runs","volume":"20","author":"Stephenson","year":"2000","journal-title":"IEEE Computer Graphics and Applications"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB7","unstructured":"Stephenson PD, Litow B. The line and the two-dimensional lattice. Technical Report 1996\/01, Department of Computer Science, James Cook University, Townsville QLD Australia 4811, January 1996."},{"key":"10.1016\/S0097-8493(01)00096-6_BIB8","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/TEC.1961.5219197","article-title":"On the encoding of arbitrary geometric configurations","volume":"EC-102","author":"Freeman","year":"1961","journal-title":"IRE Transactions"},{"issue":"1","key":"10.1016\/S0097-8493(01)00096-6_BIB9","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1016\/0146-664X(74)90010-0","article-title":"Linguistic methods for the description of a straight line on a grid","volume":"3","author":"Brons","year":"1974","journal-title":"Computer Graphics and Image Processing"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB10","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1109\/TPAMI.1982.4767258","article-title":"On the chain code of a line","volume":"PAMI-4","author":"Wu","year":"1982","journal-title":"IEEE Transactions on Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB11","doi-asserted-by":"crossref","unstructured":"Brons R. Theoretical and linguistic methods for describing straight lines. In: Earnshaw RA, editor. Fundamental algorithms for computer graphics, vol. F17 of NATO ASI. Berlin: Springer, 1985. p. 19\u201357.","DOI":"10.1007\/978-3-642-84574-1_1"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB12","unstructured":"Hung SHY, Kasvand T. On the chord property and its equivalences, Proceedings of the Seventh International Conference on Pattern Recognition. 1984. p. 116\u20139."},{"key":"10.1016\/S0097-8493(01)00096-6_BIB13","unstructured":"Weng FL, Wu LD. Covering property and \u2217-chain code. Proceedings of the Eighth International Conference on Pattern Recognition. 1986. p. 1133\u20135."},{"key":"10.1016\/S0097-8493(01)00096-6_BIB14","unstructured":"Rosenfeld A. Digital geometry: Introduction and bibliography. In: Klette R, Rosenfeld A, Sloboda F, editors. Advances in digital and computational geometry. Berlin: Springer, 1998. p. 1\u201354."},{"issue":"1","key":"10.1016\/S0097-8493(01)00096-6_BIB15","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1016\/S0146-664X(78)80014-8","article-title":"On the parallel generation of straight digital lines","volume":"7","author":"Arcelli","year":"1978","journal-title":"Computer Graphics and Image Processing"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB16","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/0146-664X(79)90002-9","article-title":"Chain-link coding and segmentation for raster scan devices","volume":"10","author":"Cederberg","year":"1979","journal-title":"Computer Graphics and Image Processing"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB17","article-title":"Modification of Bresenham's algorithm for displays","volume":"1595\u20136","author":"Gardner","year":"1975","journal-title":"IBM Technical Disclosure Bulletin"},{"issue":"1","key":"10.1016\/S0097-8493(01)00096-6_BIB18","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1016\/0097-8493(82)90010-3","article-title":"A symmetric linear algorithm for line segment generation","volume":"6","author":"Thong","year":"1982","journal-title":"Computers and Graphics"},{"issue":"4","key":"10.1016\/S0097-8493(01)00096-6_BIB19","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1145\/88560.88572","article-title":"Fast line scan-conversion","volume":"9","author":"Rokne","year":"1990","journal-title":"ACM Transactions on Graphics"},{"issue":"2","key":"10.1016\/S0097-8493(01)00096-6_BIB20","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1016\/0097-8493(95)00131-X","article-title":"Bi-directional incremental linear interpolation","volume":"20","author":"Yao","year":"1996","journal-title":"Computers & Graphics"},{"issue":"4","key":"10.1016\/S0097-8493(01)00096-6_BIB21","first-page":"331","article-title":"Double-step incremental generation of lines and circles","volume":"37","author":"Wu","year":"1987","journal-title":"Computer Graphics and Image Analysis"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB22","doi-asserted-by":"crossref","first-page":"461","DOI":"10.1016\/0097-8493(89)90007-1","article-title":"Quadruple-step line generation","volume":"13","author":"Bao","year":"1989","journal-title":"Computers and Graphics"},{"issue":"2","key":"10.1016\/S0097-8493(01)00096-6_BIB23","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1145\/130826.130833","article-title":"Double-step incremental linear interpolation","volume":"11","author":"Rokne","year":"1992","journal-title":"ACM Transactions on Graphics"},{"issue":"3","key":"10.1016\/S0097-8493(01)00096-6_BIB24","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1109\/38.279045","article-title":"Double- and triple-step incremental linear interpolation","volume":"14","author":"Graham","year":"1994","journal-title":"IEEE Computer Graphics and Applications"},{"issue":"3","key":"10.1016\/S0097-8493(01)00096-6_BIB25","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1109\/38.279047","article-title":"N-step incremental straight-line algorithm","volume":"14","author":"Gill","year":"1994","journal-title":"IEEE Computer Graphics and Applications"},{"issue":"5","key":"10.1016\/S0097-8493(01)00096-6_BIB26","doi-asserted-by":"crossref","first-page":"67","DOI":"10.1109\/38.865882","article-title":"Auto-adaptive step straight-line algorithm","volume":"20","author":"Boyer","year":"2000","journal-title":"IEEE Computer Graphics and Applications"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB27","doi-asserted-by":"crossref","first-page":"46","DOI":"10.1093\/comjnl\/23.1.46","article-title":"Line tracking for incremental plotters","volume":"23","author":"Earnshaw","year":"1980","journal-title":"Computer Journal"},{"issue":"1","key":"10.1016\/S0097-8493(01)00096-6_BIB28","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1093\/comjnl\/25.1.114","article-title":"Bresenham's algorithm with run line coding shortcut","volume":"25","author":"Pitteway","year":"1982","journal-title":"The Computer Journal"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB29","doi-asserted-by":"crossref","unstructured":"Castle CM, Pitteway MLV. An application of Euclid's algorithm to drawing straight lines. In: Earnshaw RA, editor. Fundamental algorithms for computer graphics, vol. F17 NATO ASI. Berlin: Springer, 1985. p. 135\u20139.","DOI":"10.1007\/978-3-642-84574-1_5"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB30","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1093\/comjnl\/30.2.168","article-title":"An efficient structural technique for encoding \u2018best-fit\u2019 straight lines","volume":"30","author":"Castle","year":"1987","journal-title":"The Computer Journal"},{"issue":"6","key":"10.1016\/S0097-8493(01)00096-6_BIB31","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1109\/38.103388","article-title":"Speeding up Bresenham's algorithm","volume":"11","author":"Angel","year":"1991","journal-title":"IEEE Computer Graphics and Applications"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB32","unstructured":"Reggiori GB. Digital computer transformations for irregular line drawings. Technical Report 403-22, New York University, April 1972."},{"key":"10.1016\/S0097-8493(01)00096-6_BIB33","first-page":"3744","article-title":"Run length slices for incremental lines.","volume":"22-8B","author":"Bresenham","year":"1980","journal-title":"IBM Technical Disclosure Bulletin"},{"key":"10.1016\/S0097-8493(01)00096-6_BIB34","doi-asserted-by":"crossref","unstructured":"Bresenham JE. Run length slice algorithm for incremental lines. In: Earnshaw RA, editor. Fundamental algorithms for computer graphics, vol. F17 of NATO ASI, Berlin: Springer, 1985. p. 59\u2013104.","DOI":"10.1007\/978-3-642-84574-1_2"},{"issue":"3","key":"10.1016\/S0097-8493(01)00096-6_BIB35","doi-asserted-by":"crossref","first-page":"267","DOI":"10.1111\/1467-8659.1130267","article-title":"A run-length slice line drawing algorithm without division operations","volume":"11","author":"Fung","year":"1992","journal-title":"Computer Graphics Forum (EUROGRAPHICS \u201992 Proceedings)"},{"issue":"3","key":"10.1016\/S0097-8493(01)00096-6_BIB36","doi-asserted-by":"crossref","first-page":"C377","DOI":"10.1111\/1467-8659.00358","article-title":"Fast lines: a span by span method","volume":"18","author":"Boyer","year":"1999","journal-title":"Computer Graphics Forum (Eurographics \u201999 Proceedings)"},{"issue":"12","key":"10.1016\/S0097-8493(01)00096-6_BIB37","doi-asserted-by":"crossref","first-page":"1264","DOI":"10.1109\/T-C.1974.223845","article-title":"Digital straight line segments","volume":"C-23","author":"Rosenfeld","year":"1974","journal-title":"IEEE Transactions on Computers"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849301000966?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0097849301000966?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,25]],"date-time":"2019-04-25T18:23:50Z","timestamp":1556216630000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0097849301000966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,8]]},"references-count":37,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2001,8]]}},"alternative-id":["S0097849301000966"],"URL":"https:\/\/doi.org\/10.1016\/s0097-8493(01)00096-6","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[2001,8]]}}}