Binary space partitioning: Difference between revisions

Revision as of 01:25, 3 June 2004

Revision as of 23:12, 9 June 2004

Line 1:

[[Category:Trees]]

'''Binary space partitioning''' ('''BSP''') is a method for recursively subdividing a [[Euclidean space|space]] 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'''.