{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,28]],"date-time":"2025-09-28T12:50:42Z","timestamp":1759063842585},"reference-count":21,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"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":["Information Sciences"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0020-0255(93)90025-h","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"123-154","source":"Crossref","is-referenced-by-count":3,"title":["Linear hypertree for multi-dimensional image representation"],"prefix":"10.1016","volume":"68","author":[{"given":"Djaffer","family":"Ibaroudene","sequence":"first","affiliation":[]},{"given":"Raj","family":"Acharya","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(93)90025-H_BIB1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0734-189X(83)90017-8","article-title":"A data structure and algorithm based on linear key for rectangle retrieval problem","volume":"24","author":"Abel","year":"1983","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/0020-0255(93)90025-H_BIB2","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1016\/0146-664X(82)90058-2","article-title":"Linear octrees for fast processing of three-dimensional objects","volume":"20","author":"Gargantini","year":"1982","journal-title":"Comput. Graphics Image Process."},{"key":"10.1016\/0020-0255(93)90025-H_BIB3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0734-189X(87)80200-1","article-title":"Real time display and manipulation of 3-D medical objects: the voxel processor architecture","volume":"39","author":"Goldweisser","year":"1987","journal-title":"Comput. Vision Graphics Image Process."},{"key":"10.1016\/0020-0255(93)90025-H_BIB4","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1109\/TPAMI.1983.4767433","article-title":"Quad-trees, oct-trees, and k-trees\u2014a generalized approach to recursive decomposition of Euclidean space","volume":"5","author":"Jackins","year":"1983","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0020-0255(93)90025-H_BIB5","doi-asserted-by":"crossref","first-page":"249","DOI":"10.1016\/0146-664X(80)90055-6","article-title":"Octrees and their use in representing three dimensional objects","volume":"14","author":"Jackins","year":"1980","journal-title":"Comput. Graphics Image Process"},{"key":"10.1016\/0020-0255(93)90025-H_BIB6","doi-asserted-by":"crossref","first-page":"244","DOI":"10.1109\/TPAMI.1984.4767508","article-title":"Space and time efficient virtual quadtrees","volume":"PAMI-6","author":"Jones","year":"1984","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"10.1016\/0020-0255(93)90025-H_BIB7","series-title":"The Art of Computer Programming, Vol. 1, Fundamental Algorithms","author":"Knuth","year":"1975"},{"key":"10.1016\/0020-0255(93)90025-H_BIB8","doi-asserted-by":"crossref","first-page":"631","DOI":"10.1145\/28569.28574","article-title":"Adjacency detection using quadcodes","volume":"30","author":"Li","year":"1987","journal-title":"Commun. ACM"},{"key":"10.1016\/0020-0255(93)90025-H_BIB9","article-title":"Octree Encoding: A New Technique for the Representation, Manipulation, and Display of Arbitrary 3-D Objects by Computer","author":"Meagher","year":"1980"},{"key":"10.1016\/0020-0255(93)90025-H_BIB10","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1145\/356924.356930","article-title":"Quadtree and related hierarchical data structures","volume":"16","author":"Samet","year":"1984","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0020-0255(93)90025-H_BIB11","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1145\/356859.356862","article-title":"Representation of three-dimensional digital images","volume":"13","author":"Srihari","year":"1981","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0020-0255(93)90025-H_BIB12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1109\/TPAMI.1982.4767193","article-title":"Boundary detection in multi-dimensions","volume":"4","author":"Udupa","year":"1982","journal-title":"IEEE Trans. Pattern Analysis Mach. Intell."},{"key":"10.1016\/0020-0255(93)90025-H_BIB13","doi-asserted-by":"crossref","first-page":"504","DOI":"10.1145\/358150.358158","article-title":"A hierarchical data structure for multidimensional digital images","volume":"26","author":"Yau","year":"1983","journal-title":"Commun. ACM"},{"key":"10.1016\/0020-0255(93)90025-H_BIB14","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1016\/0020-0255(87)90015-6","article-title":"Generalized distance in digital geometry","volume":"42","author":"Das","year":"1987","journal-title":"Inform. Sci."},{"key":"10.1016\/0020-0255(93)90025-H_BIB15","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/0262-8856(90)90026-2","article-title":"Adjacency algorithms for linear octree nodes","volume":"8","author":"Ibaroudene","year":"1990","journal-title":"Image Vision Comput."},{"key":"10.1016\/0020-0255(93)90025-H_BIB16","doi-asserted-by":"crossref","first-page":"48","DOI":"10.1109\/38.513","article-title":"Hierarchical data structures and algorithms for computer graphics. Part I: fundamentals","author":"Samet","year":"1988","journal-title":"IEEE Comput. Graphics Appl."},{"key":"10.1016\/0020-0255(93)90025-H_BIB17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1109\/38.7750","article-title":"Hierarchical data structures and algorithms for computer graphics. Part II: applications","author":"Samet","year":"1988","journal-title":"IEEE Comput. Graphics Appl."},{"key":"10.1016\/0020-0255(93)90025-H_BIB18","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1016\/0167-8655(89)90034-2","article-title":"Ray representation for k-trees","volume":"10","author":"Akman","year":"1989","journal-title":"Pattern Recogn. Lett."},{"key":"10.1016\/0020-0255(93)90025-H_BIB19","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1016\/0097-8493(89)90088-5","article-title":"Representing objects as rays, or how to pile up an octree?","volume":"13","author":"Akman","year":"1989","journal-title":"Comput. Graphics"},{"key":"10.1016\/0020-0255(93)90025-H_BIB20","article-title":"Fast Methods for 3D Display of Medical Objects","author":"Reynolds","year":"1985"},{"key":"10.1016\/0020-0255(93)90025-H_BIB21","doi-asserted-by":"crossref","first-page":"1089","DOI":"10.1016\/0898-1221(85)90187-7","article-title":"On the quadtrees generalized to d-dimensional binary pictures","volume":"11","author":"Walsh","year":"1985","journal-title":"Comput. Math. Appl."}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559390025H?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002002559390025H?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T13:27:39Z","timestamp":1552915659000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002002559390025H"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":21,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["002002559390025H"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(93)90025-h","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}