{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T21:21:36Z","timestamp":1649107296294},"reference-count":14,"publisher":"Elsevier BV","issue":"11","license":[{"start":{"date-parts":[[1995,11,1]],"date-time":"1995-11-01T00:00:00Z","timestamp":815184000000},"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 Letters"],"published-print":{"date-parts":[[1995,11]]},"DOI":"10.1016\/0167-8655(95)00072-o","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:20:02Z","timestamp":1027639202000},"page":"1137-1145","source":"Crossref","is-referenced-by-count":6,"title":["A random model for analyzing region quadtrees"],"prefix":"10.1016","volume":"16","author":[{"given":"Michael","family":"Vassilakopoulos","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yannis","family":"Manolopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0167-8655(95)00072-O_bib1","doi-asserted-by":"crossref","first-page":"131","DOI":"10.1016\/0167-8655(85)90019-4","article-title":"Expected and worst-case storage requirements for quadtrees","volume":"3","author":"Burton","year":"1985","journal-title":"Pattern Recognition Lett."},{"issue":"1","key":"10.1016\/0167-8655(95)00072-O_bib2","doi-asserted-by":"crossref","first-page":"25","DOI":"10.1109\/TPAMI.1983.4767341","article-title":"Markov random field texture models","volume":"5","author":"Cross","year":"1983","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"1","key":"10.1016\/0167-8655(95)00072-O_bib3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1016\/0167-8655(92)90112-D","article-title":"Analytical results on the quadtree decomposition of arbitrary rectangles","volume":"13","author":"Faloutsos","year":"1992","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0167-8655(95)00072-O_bib4","series-title":"Proc. ACM Principles of Database Systems Conf.","first-page":"4","article-title":"Beyond uniformity and Independence: Analysis of R-trees using the concept of fractal dimension","author":"Faloutsos","year":"1994"},{"issue":"7","key":"10.1016\/0167-8655(95)00072-O_bib5","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1007\/BF01891833","article-title":"Analytic variations on quadtrees","volume":"10","author":"Flajolet","year":"1993","journal-title":"Algorithmica"},{"issue":"2","key":"10.1016\/0167-8655(95)00072-O_bib6","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1016\/0020-0190(87)90043-3","article-title":"Average efficiency of data structures for binary image processing","volume":"26","author":"Mathieu","year":"1987","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0167-8655(95)00072-O_bib7","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0146-664X(82)90098-3","article-title":"Neighbor finding techniques for images represented by quadtrees","volume":"18","author":"Samet","year":"1982","journal-title":"Computer Graphics and Image Processing"},{"key":"10.1016\/0167-8655(95)00072-O_bib8","series-title":"The Design and Analysis of Spatial Data Structures","author":"Samet","year":"1990"},{"key":"10.1016\/0167-8655(95)00072-O_bib9","series-title":"Applications of Spatial Data Structures","author":"Samet","year":"1990"},{"issue":"6","key":"10.1016\/0167-8655(95)00072-O_bib10","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1109\/TPAMI.1985.4767729","article-title":"A model for the analysis of neighbor finding in pointer-based quadtrees","volume":"7","author":"Samet","year":"1985","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"issue":"I","key":"10.1016\/0167-8655(95)00072-O_bib11","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0167-8655(88)90043-8","article-title":"A formula for computing the number of quadtree nodes created by a shift","volume":"7","author":"Shaffer","year":"1988","journal-title":"Pattern Recognition Lett."},{"key":"10.1016\/0167-8655(95)00072-O_bib12","series-title":"Proc. 5th Internat. Conf. on Computer Analysis of Images and Patterns","first-page":"41","article-title":"Analytical results on the quadtree storage-requirements","author":"Vassilakopoulos","year":"1993"},{"key":"10.1016\/0167-8655(95)00072-O_bib13","first-page":"431","article-title":"Average-case analysis of algorithms and data structures","author":"Vitter","year":"1990"},{"issue":"5","key":"10.1016\/0167-8655(95)00072-O_bib14","doi-asserted-by":"crossref","first-page":"341","DOI":"10.1016\/0167-8655(87)90017-1","article-title":"Distribution of black nodes at various levels in a linear quadtree","volume":"6","author":"Unnikrishnan","year":"1987","journal-title":"Pattern Recognition Lett."}],"container-title":["Pattern Recognition Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559500072O?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016786559500072O?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T06:27:23Z","timestamp":1555568843000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016786559500072O"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995,11]]},"references-count":14,"journal-issue":{"issue":"11","published-print":{"date-parts":[[1995,11]]}},"alternative-id":["016786559500072O"],"URL":"https:\/\/doi.org\/10.1016\/0167-8655(95)00072-o","relation":{},"ISSN":["0167-8655"],"issn-type":[{"value":"0167-8655","type":"print"}],"subject":[],"published":{"date-parts":[[1995,11]]}}}