A general PASCAL program for map overlay of quadtrees and related problems
The Computer Journal
A formula for computing the number of quadtree node fragments created by a shift
Pattern Recognition Letters
Analytical results on the quadtree decomposition of arbitrary rectangles
Pattern Recognition Letters
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Functional Programming with Quadtrees
IEEE Software
Sampling from Spatial Databases
Proceedings of the Ninth International Conference on Data Engineering
Analytical Results on the Quadtree Storage-Requirements
CAIP '93 Proceedings of the 5th International Conference on Computer Analysis of Images and Patterns
Overlapping linear quadtrees: a spatio-temporal access method
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
An efficient data structure for storing similar binary images
Information organization and databases
Processing of Spatio-Temporal Queries in Image Databases
ADBIS '99 Proceedings of the Third East European Conference on Advances in Databases and Information Systems
| Hi-index | 0.00 |
The technique of overlapping region quadtrees results in significant space reduction. This new form of data structure is suitable for representing sequences of similar binary raster images emerging in many areas. Apart from a short introduction to the method of overlapping, an analysis of the space reduction achieved is presented in this article. First, a general theorem about the average number of common nodes of two images obeying a general model is given. Next, two models of image similarity are introduced and the respective formulae are derived from the general one. Evaluating these formulae for various parameters shows the efficiency of overlapping.