Binary space partitioning

<p>In <a href="/facts/Computer_science/lN3pEyPz">computer science</a>, binary space partitioning (BSP) is a method for <a href="/facts/Space_partitioning/znppkQCM">space partitioning</a> which <a href="/facts/Recursively/CxSKxJoW">recursively</a> subdivides a <a href="/facts/Euclidean_space/R2UbzmzM">Euclidean space</a> into two <a href="/facts/Convex_set/vdAuJRJl">convex sets</a> by using <a href="/facts/Hyperplane/2s2ycYYd">hyperplanes</a> as partitions. This process of subdividing gives rise to a representation of objects within the space in the form of a <a href="/facts/Tree_(data_structure)/RcXz9noF">tree data structure</a> known as a BSP tree.
</p><p>Binary space partitioning was developed in the context of <a href="/facts/3D_computer_graphics/zlWW6eaF">3D computer graphics</a> in 1969. The structure of a BSP tree is useful in <a href="/facts/Rendering_(computer_graphics)/YYxfnmAq">rendering</a> because it can efficiently give spatial information about the objects in a scene, such as objects being ordered from front-to-back with respect to a viewer at a given location. Other applications of BSP include: performing <a href="/facts/Geometrical/wTQf5ffQ">geometrical</a> operations with <a href="/facts/Shape/NbaGtA8f">shapes</a> (<a href="/facts/Constructive_solid_geometry/Dcs2fzyU">constructive solid geometry</a>) in <a href="/facts/Computer-aided_design/5gSXrmmN">CAD</a>, <a href="/facts/Collision_detection/kXkE9WXv">collision detection</a> in <a href="/facts/Robotics/wkmvodJz">robotics</a> and 3D video games, <a href="/facts/Ray_tracing_(graphics)/n6qpap2q">ray tracing</a>, virtual landscape simulation, and other applications that involve the handling of complex spatial scenes.
</p>

Binary space partitioning open-in-new

Binary space partitioning