Abstract
In this paper an alternative non-pointer quadtree node codification to manage geographical spatial data is presented. New codification is based on a variable sequence of z-ordered base four digits. Memory requirements of the new codification are lower than previous codifications, and in particular lower than FD codification, the most commonly used in linear quadtrees. Furthermore, z-ordering makes compatible new codification with most of the algorithms developed for FD.
Chapter PDF
Similar content being viewed by others
References
Gargantini, I.: An Effective Way to Represent Quadtrees. Communications of the ACM 25(12), 905–910 (1982)
Li, S., Loew, M.H.: The Quadcode and its Arithmetic. Communications of the ACM 30(7), 621–626 (1987)
Samet, H.: Applications of spatial data structures: Computer graphics, image processing, and GIS. Addison-Wesley Longman Publishing Co., Inc., Boston (1990)
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–7 (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Pérez, M., Benavent, X., Olanda, R. (2006). Efficient Coding of Quadtree Nodes. In: Alexandrov, V.N., van Albada, G.D., Sloot, P.M.A., Dongarra, J. (eds) Computational Science – ICCS 2006. ICCS 2006. Lecture Notes in Computer Science, vol 3993. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11758532_3
Download citation
DOI: https://doi.org/10.1007/11758532_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-34383-7
Online ISBN: 978-3-540-34384-4
eBook Packages: Computer ScienceComputer Science (R0)