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:
“The merit of those who fill a space in the world’s history, who are borne forward, as it were, by the weight of thousands whom they lead, shed a perfume less sweet than do the sacrifices of private virtue.”
—Ralph Waldo Emerson (1803–1882)