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.
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.
