A hierarchical data model that provides a compact raster representation by using a variable-sized grid cell. Finer subdivisions are used in areas requiring finer detail, providing a higher level of resolution. As the map theme becomes more variable or complex, a quadtree structure is not as efficient as some other data models.

Term used to describe a class of hierarchical data structures based on the principle of recursively decomposing an image into mutually exclusive quarters or quads until a region is homogeneous or until some specified level has been reached.

A way of encoding raster data that attempts to reduce storage requirements by avoiding sub-dividing homogeneous areas rather than storing values for every pixel.

a hierarchical data structure often used for image representation

a means of encoding an image as a tree structure

a partition of a region of the plane into axis aligned squares

a recursive decomposition of a two dimensional environment

a recursive subdivision of the plane into square boxes

a representation format used to encode images

a spatial data structure built by a recursive decomposition of space into quadrants

a tree data structure based on a rectangle with four

A spatial index that breaks a spatial dataset into homogenous cells of regularly decreasing size. Each decrement in size is 1/4 the area of the previous cell. The quadtree segmentation process continues until the entire map is partitioned. Quadtrees are often used for storing raster data.

A spatial data structure based on successive subdivision of an area, the purpose of which is to minimise data redundancy.

A data structure for thematic information in a raster database that seeks to minimize data storage.

Quadtree is a dynamic partition of a zone into four equal quadrants.

A data tree-structure where each node has four branches. Usually used to partition space in a two-dimensional plane. The square area represented by a node is split into 4 equal squares and every branch represents one of those squares, which might be split itself in turn. [ edit

A spatial index which recursively decomposes a data set (e.g., image) into square cells of different sizes until each cell has a homogeneous value. Quadtrees are often used for storing raster data. See also spatial indexing.

A quadtree is a tree data structure in which each internal node has up to four children. Quadtrees are most often used to partition a two dimensional space by recursively subdividing it into four quadrants or regions. The regions may be square or rectangular, or may have arbitrary shapes.