Skip to search formSkip to main contentSkip to account menu

Binary space partitioning

Known as: BSP, BSP tree, Binary space partition 
In computer science, binary space partitioning (BSP) is a method for recursively subdividing a space into convex sets by hyperplanes. This… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
3D GamestudioBack-face cullingBinary treeBounding volume hierarchy

Broader (2)

3D computer graphicsVideo game development

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
Binary Space Partitioning Forests
The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally… 
2019
2019
Binary Space Partitioning Forest
The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally… 
2011
2011
Accurate Area, Time and Power Models for FPGA-Based Implementations
This paper presents accurate area, time, power estimation models for implementations using FPGAs from the Xilinx Virtex-2Pro… 
Highly Cited
2010
Highly Cited
2010
Algorithmic Aspects of Hardware/Software Partitioning: 1D Search Algorithms
Hardware/software (HW/SW) partitioning is one of the key challenges in HW/SW codesign. This paper presents efficient algorithms… 
Highly Cited
2008
Highly Cited
2008
High-pressure solid/liquid partitioning of Os, Re and Pt in the Fe–S system
Highly Cited
2003
Highly Cited
2003
Building Extraction using Lidar DEMs and Ikonos Images
An automated method for boundary representation of building objects has been considered as a core processor for 3D city modelling… 
Highly Cited
1998
Highly Cited
1998
High-level estimation techniques for usage in hardware/software co-design
  • J. HenkelR. Ernst
  • Proceedings of Asia and South Pacific Design…
  • 1998
  • Corpus ID: 12657309
High-level estimation techniques are of paramount importance for design decisions like hardware/software partitioning or design… 
Highly Cited
1994
Highly Cited
1994
Meeting QOS requirements in a cellular network with reuse partitioning
Reuse partitioning is a technique for providing more efficient spectrum reuse in cellular radio systems. A cell in such a system… 
1990
1990
On constructing binary space partitioning trees
Binary Space Partitioning Trees have several applications in computer graphics. We prove that there exist n-polygon problem… 
Highly Cited
1987
Highly Cited
1987
A vertical partitioning algorithm for relational databases
In a relational database environment, transaction response time is likely to be affected by the time required to read the… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)