Space Partitioning

In mathematics, space partitioning is the process of dividing a space (usually a Euclidean space) into two or more disjoint subsets (see also partition of a set). In other words, space partitioning divides a space into non-overlapping regions. Any point in the space can then be identified to lie in exactly one of the regions.

Read more about Space PartitioningOverview, Use in Computer Graphics, Other Uses, Types of Space Partitioning Data Structures

Other articles related to "space partitioning":

List Of Data Structures - Trees - Space-partitioning Trees
... These are data structures used for space partitioning or binary space partitioning ... Segment tree Interval tree Range tree Bin Kd-tree Implicit kd-tree Min/max kd-tree Adaptive k-d tree Quadtree Octree Linear octree Z-order UB-tree R-tree R+ tree R* tree Hilbert R-tree X-tree Metric tree Cover tree M-tree VP-tree BK-tree Bounding interval hierarchy BSP tree Rapidly exploring random tree ...
Types of Space Partitioning Data Structures
... Common space partitioning systems include BSP trees Quadtrees Octrees kd-trees Bins R-trees Bounding volume hierarchies SEADSs ...

Famous quotes containing the word space:

    Thus all our dignity lies in thought. Through it we must raise ourselves, and not through space or time, which we cannot fill. Let us endeavor, then, to think well: this is the mainspring of morality.
    Blaise Pascal (1623–1662)