Geometric data structures

method for recursively subdividing a space into two subsets using hyperplanes

multidimensional search tree for points in k dimensional space

thumb|300px|A point-region quadtree with point data. Bucket capacity 1. thumb|300x300px|Quadtree compression of an image step by step. Left shows the compressed image with the tree bounding boxes while the right shows just the compressed image A quadtree is a tree data structure in which each internal node has exactly four children. Quadtrees are the two-dimensional analog of octrees and are most often used to partition a two-dimensional space by recursively subdividing it into four quadrants or regions. The data associated with a leaf cell varies by application, but the leaf cell represents a

geometric data structure

function which maps multidimensional data to one dimension while preserving locality of the data points

thumb|Cube with a simple lightmap (shown on the right). A lightmap is a data structure used in lightmapping, a form of surface caching in which the brightness of surfaces in a virtual scene is pre-calculated and stored in texture maps for later use. Lightmaps are most commonly applied to static objects in applications that use real-time 3D computer graphics, such as video games, in order to provide lighting effects such as global illumination at a relatively low computational cost.

data structure to represent an embedding of a planar graph in the plane, and polytopes in 3D

overview about the hierarchy of bounding volume hierarchy

technique used to model the surface of a sphere with a subdivided polyhedron