Efficient coding of quadtree nodes

Authors:
Mariano Pérez;Xaro Benavent;R. Olanda
Affiliations:
Instituto de Robótica., University of Valencia, Paterna, Spain;Instituto de Robótica., University of Valencia, Paterna, Spain;Instituto de Robótica., University of Valencia, Paterna, Spain
Venue:
ICCS'06 Proceedings of the 6th international conference on Computational Science - Volume Part III
Year:
2006

Citing 4
Cited 1

The quadcode and its arithmetic

Communications of the ACM
Applications of spatial data structures: Computer graphics, image processing, and GIS

Applications of spatial data structures: Computer graphics, image processing, and GIS
Overlapping linear quadtrees: a spatio-temporal access method

Proceedings of the 6th ACM international symposium on Advances in geographic information systems
An effective way to represent quadtrees

Communications of the ACM

Location-aware type ahead search on spatial databases: semantics and efficiency

Proceedings of the 2011 ACM SIGMOD International Conference on Management of data

Quantified Score

Hi-index	0.00

Visualization

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.