Binary space partitioning is a technique used to subdivide a euclidean space into smaller, convex sets. Partitioning is achieved recursively using hyperplanes. A binary tree, called the BSP tree, is used to represent such partitioning.

There is no tag wiki for this tag … yet!

Tag wikis help introduce newcomers to the tag. They contain an overview of the topic defined by the tag, along with guidelines on its usage.

All registered users may propose new tag wikis.

(Note that if you have less than 20000 reputation, your tag wiki will be peer reviewed before it is published.)