{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:27:24Z","timestamp":1725550044302},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540234784"},{"type":"electronic","value":"9783540301981"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-30198-1_21","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:36:52Z","timestamp":1268401012000},"page":"203-212","source":"Crossref","is-referenced-by-count":0,"title":["Non-interleaved Quadtree Node Codification"],"prefix":"10.1007","author":[{"given":"Mariano","family":"P\u00e9rez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcos","family":"Fern\u00e1ndez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ricardo","family":"Olanda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/3-540-48482-5_16","volume-title":"Advances in Spatial Databases","author":"A. Corral","year":"1999","unstructured":"Corral, A., Vassilakopous, M., Manolopoulos, Y.: Algorithms for joining r-trees and linear region quadtrees. In: G\u00fcting, R.H., Papadias, D., Lochovsky, F.H. (eds.) SSD 1999. LNCS, vol.\u00a01651, pp. 251\u2013269. Springer, Heidelberg (1999)"},{"issue":"12","key":"21_CR2","doi-asserted-by":"publisher","first-page":"905","DOI":"10.1145\/358728.358741","volume":"25","author":"I. Gargantini","year":"1982","unstructured":"Gargantini, I.: An effective way to represent quadtrees. Communications of the ACM\u00a025(12), 905\u2013910 (1982)","journal-title":"Communications of the ACM"},{"issue":"2","key":"21_CR3","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/s00778-002-0067-8","volume":"11","author":"G.R. Hjaltason","year":"2002","unstructured":"Hjaltason, G.R., Samet, H.: Speeding up construction of pmr quadtree-based spatial indexes. The VLDB Journal - The International Journal onVery Large Data Bases\u00a011(2), 109\u2013137 (2002)","journal-title":"The VLDB Journal - The International Journal onVery Large Data Bases"},{"key":"21_CR4","volume-title":"Optimatizacion Methods in Statistics","author":"A. Klinger","year":"1971","unstructured":"Klinger, A.: Patterns and search statistics. In: Optimatizacion Methods in Statistics. Academic Press, NewYork (1971)"},{"issue":"7","key":"21_CR5","doi-asserted-by":"publisher","first-page":"627","DOI":"10.1145\/28569.28574","volume":"30","author":"S.-X. Li","year":"1987","unstructured":"Li, S.-X., Loew, M.H.: Adjacency detection using quadcodes. Communications of the ACM\u00a030(7), 627\u2013631 (1987)","journal-title":"Communications of the ACM"},{"issue":"7","key":"21_CR6","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1145\/28569.28573","volume":"30","author":"S.-X. Li","year":"1987","unstructured":"Li, S.-X., Loew, M.H.: The quadcode and its arithmetic. Communications of the ACM\u00a030(7), 621\u2013626 (1987)","journal-title":"Communications of the ACM"},{"issue":"2","key":"21_CR7","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1145\/356924.356930","volume":"16","author":"H. Samet","year":"1984","unstructured":"Samet, H.: The quadtree and related hierarchical data structures. ACMComputing Surveys\u00a016(2), 187\u2013260 (1984)","journal-title":"ACMComputing Surveys"},{"key":"21_CR8","volume-title":"Applications of spatial data structures: Computer graphics, image processing, and GIS","author":"H. Samet","year":"1990","unstructured":"Samet, H.: Applications of spatial data structures: Computer graphics, image processing, and GIS. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)"},{"key":"21_CR9","volume-title":"The design and analysis of spatial data structures","author":"H. Samet","year":"1990","unstructured":"Samet, H.: The design and analysis of spatial data structures. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)"},{"issue":"2","key":"21_CR10","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/S0146-664X(75)80003-7","volume":"4","author":"S. Tanimoto","year":"1975","unstructured":"Tanimoto, S., Pavlidis, T.: A hierarchical data structure for picture processing. Computer Graphics and Image Processing\u00a04(2), 104\u2013119 (1975)","journal-title":"Computer Graphics and Image Processing"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Tzouramanis, T., Vassilakopoulos, M., Manolopoulos, Y.: Overlapping linear quadtrees: a spatio-temporal access method. In: Proc. 6th ACM Symposium on Advances in Geographic Information Systems (ACM-GIS 1998), pp. 1\u20137 (1998)","DOI":"10.1145\/288692.288695"}],"container-title":["Lecture Notes in Computer Science","Advances in Information Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-30198-1_21.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:54:16Z","timestamp":1620014056000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-30198-1_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540234784","9783540301981"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-30198-1_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}