{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,9,13]],"date-time":"2023-09-13T11:00:02Z","timestamp":1694602802332},"reference-count":17,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1984,1,1]],"date-time":"1984-01-01T00:00:00Z","timestamp":441763200000},"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":["Pattern Recognition"],"published-print":{"date-parts":[[1984,1]]},"DOI":"10.1016\/0031-3203(84)90078-5","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"285-293","source":"Crossref","is-referenced-by-count":16,"title":["Linear quadtrees: A blocking technique for contour filling"],"prefix":"10.1016","volume":"17","author":[{"given":"I.","family":"Gargantini","sequence":"first","affiliation":[]},{"given":"H.H.","family":"Atkinson","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(84)90078-5_BIB1","first-page":"905","article-title":"An effective way to represent quadtrees","volume":"25","author":"Gargantini","year":"1982","journal-title":"Commun. Ass. comput. Mach."},{"key":"10.1016\/0031-3203(84)90078-5_BIB2","first-page":"123","article-title":"Linear quad- and octtrees: their use in generating simple algorithms for image processing","author":"Gargantini","year":"1982"},{"key":"10.1016\/0031-3203(84)90078-5_BIB3","doi-asserted-by":"crossref","first-page":"319","DOI":"10.1016\/0898-1221(82)90014-1","article-title":"Detection of connectivity for regions represented by linear quadtrees","volume":"8","author":"Gargantini","year":"1981","journal-title":"Comp. Math. Applic."},{"key":"10.1016\/0031-3203(84)90078-5_BIB4","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0146-664X(82)90058-2","article-title":"Linear oct-trees for fast processing of three-dimensional objects","volume":"20","author":"Gargantini","year":"1982","journal-title":"Comput. Graphics Image Process"},{"key":"10.1016\/0031-3203(84)90078-5_BIB5","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/S0020-7373(83)80009-1","article-title":"Translation, rotation and superposition of linear quadtrees","volume":"18","author":"Gargantini","year":"1983","journal-title":"Int. J. Man. Mach. Stud."},{"key":"10.1016\/0031-3203(84)90078-5_BIB6","article-title":"A software package for linear quadtrees","author":"Tabakman","year":"1982"},{"key":"10.1016\/0031-3203(84)90078-5_BIB7","first-page":"126","article-title":"An algorithm for shading of regions in vector display graphics","volume":"79","author":"Brassel","year":"1979"},{"key":"10.1016\/0031-3203(84)90078-5_BIB8","first-page":"111","article-title":"How to color in a coloring book","volume":"78","author":"Lieberman","year":"1978"},{"key":"10.1016\/0031-3203(84)90078-5_BIB9","series-title":"Principle of Interactive Graphics","author":"Newman","year":"1979"},{"key":"10.1016\/0031-3203(84)90078-5_BIB10","series-title":"Algorithms for Graphics and Image Processing","author":"Pavlidis","year":"1982"},{"key":"10.1016\/0031-3203(84)90078-5_BIB11","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1016\/0146-664X(79)90046-7","article-title":"Filling algorithms for raster graphics","volume":"10","author":"Pavlidis","year":"1979","journal-title":"Comput. Graphics Image Process"},{"key":"10.1016\/0031-3203(84)90078-5_BIB12","first-page":"163","article-title":"Region representation: quadtree from boundary codes","volume":"23","author":"Samet","year":"1980","journal-title":"Commun. Ass. comput. Mach."},{"key":"10.1016\/0031-3203(84)90078-5_BIB13","first-page":"321","article-title":"Filling regions in binary raster images\u2014a graph theoretical approach","volume":"80","author":"Shani","year":"1980"},{"key":"10.1016\/0031-3203(84)90078-5_BIB14","first-page":"276","article-title":"Tint fill","volume":"79","author":"Smith","year":"1979"},{"key":"10.1016\/0031-3203(84)90078-5_BIB15","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1145\/965161.806786","article-title":"Contour filling in raster graphics","volume":"15","author":"Pavlidis","year":"1981","journal-title":"Ass. comput. Mach. Comput. Graphics"},{"key":"10.1016\/0031-3203(84)90078-5_BIB16","series-title":"Proc. Twelfth Conf. Numerical Mathematics and Computing","first-page":"257","article-title":"Separation of connected components using linear quad- and oct-trees","author":"Gargantini","year":"1982"},{"key":"10.1016\/0031-3203(84)90078-5_BIB17","doi-asserted-by":"crossref","first-page":"146","DOI":"10.1145\/321556.321570","article-title":"Connectivity in digital pictures","volume":"17","author":"Rosenfeld","year":"1970","journal-title":"J. Ass. comput. Mach."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320384900785?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320384900785?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T10:20:15Z","timestamp":1552904415000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0031320384900785"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1984,1]]},"references-count":17,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1984,1]]}},"alternative-id":["0031320384900785"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(84)90078-5","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1984,1]]}}}