In computer science, binary space partitioning is a method for space partitioning which recursively subdivides an Euclidean space into two convex sets by using hyperplanes as partitions. Wikipedia