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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2019
2019
The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally… 
2019
2019
The Binary Space Partitioning~(BSP)-Tree process is proposed to produce flexible 2-D partition structures which are originally… 
2013
2013
By employing 35 intra prediction modes, HEVC standard performs better to remove spatial redundancy between the current block and… 
2012
2012
An autonomous agent embodied in a humanoid robot, in order to learn from the overwhelming flow of raw and noisy sensory, has to… 
Highly Cited
2003
Highly Cited
2003
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
  • J. HenkelR. Ernst
  • 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
Reuse partitioning is a technique for providing more efficient spectrum reuse in cellular radio systems. A cell in such a system… 
1990
1990
Binary Space Partitioning Trees have several applications in computer graphics. We prove that there exist n-polygon problem…