Revision as of 21:46, 1 June 2004 edit Altenmann (talk \| contribs) Autopatrolled, Extended confirmed users, Pending changes reviewers 244,856 edits guys, I am repeating about intro, DON'T assume a single app area. Don't assume you know it all. At least read before writing. ← Previous edit		Revision as of 22:08, 1 June 2004 edit undo Fredrik (talk \| contribs) 23,349 edits try another way of wording it... no, this isn't perfect, so feel free to scramble it Next edit →
Line 1: '''Binary space partitioning'''~~, also referred to as~~ ('''BSP''',) is ~~the~~a method offor ~~preprocessing~~recursively ofsubdividing a ~~three-dimensional~~ [[~~scene~~Euclidean ~~(computer graphics)~~space\|~~scene~~space]] ~~to enhance its subsequent processing (rendering, search, etc.). The method basically consists in a recursive subdivision of the scene~~ 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 the purposes 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