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
Famous quotes containing the word space:
“Not so many years ago there there was no simpler or more intelligible notion than that of going on a journey. Travel—movement through space—provided the universal metaphor for change.... One of the subtle confusions—perhaps one of the secret terrors—of modern life is that we have lost this refuge. No longer do we move through space as we once did.”
—Daniel J. Boorstin (b. 1914)