Binary space partitioning

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 the scene by means of a tree data structure known as a BSP tree.

Related Topics:
Space - Convex set - Hyperplane - Tree data structure

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

For a more general description of space partitioning, see space partitioning.

~ ~ ~ ~ ~ ~ ~ ~ ~ ~

Originally, this approach was proposed in 3D computer graphics to increase the rendering efficiency. Among other applications are performing geometrical operations with shapes (constructive solid geometry) in CAD, collision detection in robotics and 3D computer games, and other computer applications that involve handling of complex spatial scenes.

Related Topics:
3D computer graphics - Rendering - Constructive solid geometry - CAD - Collision detection - Robotics - Computer game

~ ~ ~ ~ ~ ~ ~ ~ ~ ~