In computer science, **binary space partitioning** (**BSP**) is a method for recursively subdividing a space into convex sets by hyperplanes. This subdivision gives rise to a representation of objects within the space by means of a tree data structure known as a **BSP tree**.

Binary space partitioning was developed in the context of 3D computer graphics, where the structure of a BSP tree allows spatial information about the objects in a scene that is useful in rendering, such as their ordering from front-to-back with respect to a viewer at a given location, to be accessed rapidly. Other applications include performing geometrical operations with shapes (constructive solid geometry) in CAD, collision detection in robotics and 3-D video games, ray tracing and other computer applications that involve handling of complex spatial scenes.

Read more about Binary Space Partitioning: Overview, Generation, Traversal, Timeline

### Other articles related to "binary space partitioning, space":

**Binary Space Partitioning**- Timeline

... that lie coincident with polygons to recursively partition the 3D

**space**... generation of a hierarchical polygonal data structure known as a

**Binary Space Partitioning**Tree (BSP Tree) ... size of the tree and the number of new polygons was reasonable (using a model of the

**Space**Shuttle) ...

### Famous quotes containing the word space:

“Here were poor streets where faded gentility essayed with scanty *space* and shipwrecked means to make its last feeble stand, but tax-gatherer and creditor came there as elsewhere, and the poverty that yet faintly struggled was hardly less squalid and manifest than that which had long ago submitted and given up the game.”

—Charles Dickens (1812–1870)