In [[3D computer graphics]] and [[CAD]], '''binaryBinary space partitioning''', also referred to as '''BSP''', is the method of preprocessing of a three-dimensional [[scene (computer graphics)|scene]] to enhance theits subsequent processing of the scene (its rendering, search, etc.). The method basically consists in a recursive subdivision of the scene into [[convex set]]s by [[hyperplane]]s. This subdivision gives rise to a representation of the scene by means of a [[tree data structure]] known as a '''BSP tree'''. AmongOriginally, this approach was proposed in [[3D computer graphics]] for the applicationspurposes areof [[computer rendering]]. andAmong other applications are performing geometrical operations with shapes ([[constructive solid geometry]]) in [[CAD]], [[collision detection]] in [[robotics]] and 3D [[computer game]]s, and other computer applications that involve handling of complex spatial scenes.
