Binary space partitioning: Difference between revisions

Content deleted Content added
Dysprosia (talk | contribs)
Dysprosia (talk | contribs)
m (structure)
Line 1:
[[Category:Trees (structure)]]
'''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'''.