Revision as of 22:08, 1 June 2004 edit Fredrik (talk \| contribs) 23,349 edits try another way of wording it... no, this isn't perfect, so feel free to scramble it ← Previous edit		Revision as of 22:34, 1 June 2004 edit undo Altenmann (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 244,912 edits kill my mentioning of preprocessing: the simpler intro the better. "Efficiency" mentioned instead Next edit →
Line 1: '''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'''. ~~A BSP tree can be [[preprocessing\|preprocessed]] and used to enhance subsequent processing.~~ Originally, this approach was proposed in [[3D computer graphics]] ~~for~~to increase the ~~purposes~~efficiency of [[computer rendering]]. Among other applications are performing geometrical operations with shapes ([[constructive solid geometry]]) in [[CAD]], [[collision detection]] in [[robotics]] and 3D [[computer game]]s, and other computer applications that involve handling of complex spatial scenes. ==Overview==

Binary space partitioning: Difference between revisions