What is binary space partitioning?
Binary Space Partitioning (BSP) is a 3-D graphics programming technique that recursively divides space into sets of two using a series of hyperplanes. The name is derived from the fact that the data is presented in a binary tree structure. BSP renders 3D graphics by making spatial information about objects accessible more quickly.
Binary space partitioning is a 3-D graphics programming technique for dividing a scene into two recursively using hyperplanes. In other words, a 3-D scene is divided into two using a 2-D plane, then that scene is divided into 2 using a 2-D plane, and so on. The resulting data structure is a binary tree or a tree where each node has two branches.
The technique is widely used to speed up the rendering of 3-D scenes, especially in games. John Carmack used BSP in the popular 'Doom' and 'Quake' games. Because the position of objects in a scene can be determined quickly, the renderer can create a player's point of view much faster. CLT is also widely used for that Collision detection in robotics and rendering in computer aided design.