The design and analysis of spatial data structures
The design and analysis of spatial data structures
Voronoi diagrams—a survey of a fundamental geometric data structure
ACM Computing Surveys (CSUR)
A new formulation for fast image coding using quadtree representation
Pattern Recognition Letters
Boolean function-based approach for encoding of binary images
Pattern Recognition Letters
Time and space efficient secondary memory representation of quadtrees
Information Systems
Operations on binary images encoded as minimized Boolean functions
Pattern Recognition Letters
A strategy for repetitive neighbor finding in images represented by quadtrees
Pattern Recognition Letters
Fast image compression by quadtree prediction
Real-Time Imaging
Undulant-block elimination and integer-preserving matrix inversion
Science of Computer Programming
An effective way to represent quadtrees
Communications of the ACM
Robot Motion Planning
Operations on Images Using Quad Trees
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 0.00 |
Two modifications of quadtrees are described for representations of grid-oriented data. First, the extended forms of quadtree are presented, which allow homogeneous coverage of the relevant parts (or even the whole) of pictures with equal sized blocks of required dimensions being equivalent with a grid. Then a special form of quadtree is introduced enabling the storage of multi-valued data. These hierarchical forms enable multiresolution approaches when dealing with such grid-oriented data as terrain information, potentials, approximate Voronoi diagrams, but also spatial object models, etc. The data are stored directly into the matrix representation of the corresponding quadtree. More examples of application are included.