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… 
Highly Cited
2008
Highly Cited
2008
Coexisting congeners: demography, competition, and interactions with cardenolides for two milkweed‐feeding aphids
Explaining the coexistence of closely related species sharing a single resource has been a long-standing challenge in ecology… 
Highly Cited
2004
Highly Cited
2004
Parallel scientific computation - a structured approach using BSP and MPI
2003
2003
Flexible binary space partitioning for robotic rescue
In domains such as robotic rescue, robots must plan paths through environments that are complex and dynamic, and in which robots… 
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
An objective function for vertically partitioning relations in distributed databases and its analysis
Partitioning and allocation of relations is an important component of the distributed database design. Several approaches (and… 
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
1989
Highly Cited
1989
Architectural Partitioning for System Level Design
Architectural partitioning is introduced as a new phase in system level synthesis. Architectural partitioning extracts high level… 
Highly Cited
1980
Highly Cited
1980
Monte Carlo comparisons of selected clustering procedures
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)