{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,13]],"date-time":"2025-10-13T08:54:07Z","timestamp":1760345647799},"reference-count":29,"publisher":"Elsevier BV","issue":"3-4","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"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":[[1985,1]]},"DOI":"10.1016\/0031-3203(85)90047-0","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:41:01Z","timestamp":1056998461000},"page":"215-226","source":"Crossref","is-referenced-by-count":14,"title":["Improvements to a recent 3d-border algorithm"],"prefix":"10.1016","volume":"18","author":[{"given":"H.H.","family":"Atkinson","sequence":"first","affiliation":[]},{"given":"I.","family":"Gargantini","sequence":"additional","affiliation":[]},{"given":"M.V.S.","family":"Ramanath","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0031-3203(85)90047-0_BIB1","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1016\/S0146-664X(77)80008-7","article-title":"Two- and three-dimensional boundary detection","volume":"6","author":"Liu","year":"1977","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/0031-3203(85)90047-0_BIB2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0146-664X(81)90103-9","article-title":"The theory, design, implementation and evaluation of a three-dimensional surface detection algorithm","volume":"15","author":"Artzy","year":"1981","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/0031-3203(85)90047-0_BIB3","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TPAMI.1982.4767193","article-title":"Boundary detection in multidimensions","volume":"PAMI-4","author":"Udupa","year":"1982","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0031-3203(85)90047-0_BIB4","series-title":"Proc. International Society for Optical Engineering, Geneva","first-page":"98","article-title":"An approximation to the 3D border","author":"Gargantini","year":"1983"},{"key":"10.1016\/0031-3203(85)90047-0_BIB5","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/BF02243773","article-title":"Determination of the 3D border by repeated elimination of internal surfaces","volume":"32","author":"Atkinson","year":"1984","journal-title":"Computing"},{"key":"10.1016\/0031-3203(85)90047-0_BIB6","series-title":"Optimized Methods in Statistics","article-title":"Pattern and search statistics","author":"Klinger","year":"1971"},{"key":"10.1016\/0031-3203(85)90047-0_BIB7","doi-asserted-by":"crossref","first-page":"50","DOI":"10.1109\/TPAMI.1979.4766875","article-title":"Organization and access of image data by areas","volume":"PAMI-1","author":"Klinger","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0031-3203(85)90047-0_BIB8","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1109\/TPAMI.1979.4766900","article-title":"Operations on images using quadtrees","volume":"PAMI-1","author":"Hunter","year":"1979","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0031-3203(85)90047-0_BIB9","first-page":"163","article-title":"Region representation: quadtrees from boundary codes","volume":"23","author":"Samet","year":"1980","journal-title":"Commun. Ass. comput. Mach."},{"key":"10.1016\/0031-3203(85)90047-0_BIB10","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1109\/TPAMI.1981.4767054","article-title":"An algorithm to convert rasters to quadtrees","volume":"PAMI-3","author":"Samet","year":"1981","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0031-3203(85)90047-0_BIB11","doi-asserted-by":"crossref","first-page":"487","DOI":"10.1145\/322261.322267","article-title":"Connected components labelling using quadtrees","volume":"28","author":"Samet","year":"1981","journal-title":"J. Ass. comput. Mach."},{"key":"10.1016\/0031-3203(85)90047-0_BIB12","first-page":"171","article-title":"Region representation: boundary codes from quadtrees","volume":"23","author":"Dyer","year":"1980","journal-title":"Commun. Ass. comput. Mach."},{"key":"10.1016\/0031-3203(85)90047-0_BIB13","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0020-0255(81)90040-2","article-title":"Path-length distances for quadtrees","volume":"23","author":"Shneier","year":"1981","journal-title":"Inf. Sci."},{"key":"10.1016\/0031-3203(85)90047-0_BIB14","series-title":"IEEE PRIP 81 Conference, Dallas","first-page":"57","article-title":"Representation of a region by a forest of quadtrees","author":"Jones","year":"1981"},{"key":"10.1016\/0031-3203(85)90047-0_BIB15","first-page":"401","article-title":"The Art of Computer Programming","volume":"Vol. 1","author":"Knuth","year":"1968"},{"key":"10.1016\/0031-3203(85)90047-0_BIB16","first-page":"905","article-title":"An effective way to store quadtrees","volume":"25","author":"Gargantini","year":"1982","journal-title":"Commun. Ass. comput. Mach."},{"key":"10.1016\/0031-3203(85)90047-0_BIB17","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(85)90047-0_BIB18","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(85)90047-0_BIB19","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1016\/0031-3203(84)90078-5","article-title":"Linear quadtrees: a blocking technique for contour filling","volume":"17","author":"Gargantini","year":"1984","journal-title":"Pattern Recognition"},{"key":"10.1016\/0031-3203(85)90047-0_BIB20","first-page":"257","article-title":"Separation of connected components using linear quad- and oct-trees","volume":"37","author":"Gargantini","year":"1982"},{"key":"10.1016\/0031-3203(85)90047-0_BIB21","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1016\/0734-189X(84)90079-3","article-title":"A B+-tree structure for large quadtrees","volume":"27","author":"Abel","year":"1984","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/0031-3203(85)90047-0_BIB22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0734-189X(83)90017-8","article-title":"A data structure based on a linear key for rectangle retrieval","volume":"24","author":"Abel","year":"1983","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/0031-3203(85)90047-0_BIB23","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1093\/comjnl\/26.1.83","article-title":"Operations on quadtree encoded images","volume":"26","author":"Oliver","year":"1983","journal-title":"Comput. J."},{"key":"10.1016\/0031-3203(85)90047-0_BIB24","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1093\/comjnl\/25.2.235","article-title":"The explicit quadtree as a structure for computer graphics","volume":"25","author":"Woodwark","year":"1982","journal-title":"Comput. J."},{"key":"10.1016\/0031-3203(85)90047-0_BIB25","doi-asserted-by":"crossref","DOI":"10.1016\/0734-189X(85)90120-3","article-title":"Set operations with linear quadtrees","author":"Bauer","year":"1985","journal-title":"Comput. Vision Graphics Image Process"},{"key":"10.1016\/0031-3203(85)90047-0_BIB26","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1016\/0734-189X(85)90118-5","article-title":"Counting regions, holes, and their nesting level in time proportional to the border","volume":"29","author":"Atkinson","year":"1985","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/0031-3203(85)90047-0_BIB27","doi-asserted-by":"crossref","first-page":"400","DOI":"10.1145\/356859.356862","article-title":"Representation of three-dimensional images","volume":"13","author":"Srihari","year":"1981","journal-title":"Comput. Surv."},{"key":"10.1016\/0031-3203(85)90047-0_BIB28","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0146-664X(80)90055-6","article-title":"Oct-trees and their use in representing three-dimensional objects","volume":"14","author":"Jankins","year":"1980","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/0031-3203(85)90047-0_BIB29","unstructured":"H. H. Atkinson, I. Gargantini and T. R. S. Walsh, Filling by quadrants or octants, Comput. Vision Graphics Image Process (submitted for publication)."}],"container-title":["Pattern Recognition"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320385900470?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0031320385900470?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:21:15Z","timestamp":1552904475000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0031320385900470"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":29,"journal-issue":{"issue":"3-4","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0031320385900470"],"URL":"https:\/\/doi.org\/10.1016\/0031-3203(85)90047-0","relation":{},"ISSN":["0031-3203"],"issn-type":[{"value":"0031-3203","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}