Method for recursively subdividing a space into two subsets using hyperplanes
This article needs additional citations for verification. Please help improve this article by adding citations to reliable sources. Unsourced material may be challenged and removed. Find sources: "Binary space partitioning" – news · newspapers · books · scholar · JSTOR(May 2016) (Learn how and when to remove this message)
The process of making a BSP tree
In computer science, binary space partitioning (BSP) is a method for space partitioning which recursively subdivides an Euclidean space into two convex sets by using hyperplanes as partitions. This process of subdividing gives rise to a representation of objects within the space in the form of a tree data structure known as a BSP tree.
Binary space partitioning was developed in the context of 3D computer graphics in 1969.[1][2] The structure of a BSP tree is useful in rendering because it can efficiently give spatial information about the objects in a scene, such as objects being ordered from front-to-back with respect to a viewer at a given location. Other applications of BSP include: performing geometrical operations with shapes (constructive solid geometry) in CAD,[3] collision detection in robotics and 3D video games, ray tracing, virtual landscape simulation,[4] and other applications that involve the handling of complex spatial scenes.
^Schumacker, R.A.; Brand, B.; Gilliland, M.G.; Sharp, W.H. (1969). Study for Applying Computer-Generated Images to Visual Simulation (Report). U.S. Air Force Human Resources Laboratory. AFHRL-TR-69-14.
^Cite error: The named reference fuchs80 was invoked but never defined (see the help page).
^
Thibault, William C.; Naylor, Bruce F. (1987). "Set operations on polyhedra using binary space partitioning trees". SIGGRAPH '87 Proceedings of the 14th annual conference on Computer graphics and interactive techniques. ACM. pp. 153–162. doi:10.1145/37402.37421.
^Etherington, Thomas R.; Morgan, Fraser J.; O’Sullivan, David (2022). "Binary space partitioning generates hierarchical and rectilinear neutral landscape models suitable for human-dominated landscapes". Landscape Ecology. 37 (7): 1761–1769. Bibcode:2022LaEco..37.1761E. doi:10.1007/s10980-022-01452-6.
and 24 Related for: Binary space partitioning information
computer science, binaryspacepartitioning (BSP) is a method for spacepartitioning which recursively subdivides an Euclidean space into two convex sets...
Recursively partitioningspace using planes in this way produces a BSP tree, one of the most common forms of spacepartitioning. Spacepartitioning is particularly...
texture on a two-sided linedef. Doom makes use of a system known as binaryspacepartitioning (BSP). A tool is used to generate the BSP data for a level beforehand...
Logical partition, a subset of a computer's resources, virtualized as a separate computer Binaryspacepartitioning, in computer science Partition problem...
Quake III Arena. The Quake engine, like the Doom engine, used binaryspacepartitioning (BSP) to optimise the world rendering. The Quake engine also used...
Ahnentafel AVL tree B-tree Binaryspacepartitioning Huffman tree K-ary tree Kraft's inequality Optimal binary search tree Random binary tree Recursion (computer...
title(sprintf('Octree-quantized %d color image', size(ImgMap, 1))) Binaryspacepartitioning Bounding interval hierarchy Cube 2: Sauerbraten, a 3D game engine...
Bromsulphthalein, a dye used in liver function tests Binaryspacepartitioning, a method for recursively subdividing a space Bit-slice processor, a cascadable processor...
B-tree Binary tree Binary search tree Self-balancing binary search tree AVL tree Red–black tree Splay tree T-tree Binaryspacepartitioning Full binary tree...
empty space, building the map block-by-block. Brushes are converted to a format the game engine can use using a process called binaryspacepartitioning. During...
methods proceed by partitioning the input set into two (or more) subsets, bounding them in the chosen bounding volume, then keep partitioning (and bounding)...
ordering. Common spatial index methods include: Binaryspacepartitioning (BSP-Tree): Subdividing space by hyperplanes. Bounding volume hierarchy (BVH)...
spatial partitioning umbrella, which includes octrees, binaryspacepartitioning (or BSP trees) and other, similar approaches. If one splits space into a...
rendering efficiency considerations. In 3D video games such as Quake, binaryspacepartitioning (BSP) trees are heavily favored to minimize visibility tests....
trigonometry topics Wallpaper group 3D projection 3D computer graphics Binaryspacepartitioning Ray tracing Graham scan Borromean rings Cavalieri's principle...
following strategies. In-place partitioning is used. This unstable partition requires O(1) space. After partitioning, the partition with the fewest elements...
that would clearly separate one zone from another. Antiportal Binaryspacepartitioning David Abramson; Alexander V. Bogdanov; Jack J. Dongarra; Albert...
such as scanline for primary visible surface determination and binaryspacepartitioning for secondary rays via ray tracing, and used Quasi-Monte Carlo...
exists a strong polychromatic 4-coloring. Binaryspacepartitioning Lengauer, Thomas (1990), "Circuit Partitioning", Combinatorial Algorithms for Integrated...
Global Information
