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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Mondrian process represents an elegant and powerful approach for space partition modelling. However, as it restricts the… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
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… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2009
2009
Multiple-volume visualization is a growing field in medical imaging providing simultaneous exploration of volumes acquired from… (More)
  • figure 1
  • figure 2
  • figure 3
  • table 2
  • table 3
Is this relevant?
2007
2007
This paper describes a new technique for dynamic binary space partitioning with applications to the dynamic hidden surface… (More)
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1996
1996
For low bit-rate compression applications, segmentation-based coding methods provide, in general, high compression ratios when… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1994
1994
Images are traditionally represented by a set of picture elements, or pixels, defined over a discrete two or three-dimensional… (More)
Is this relevant?
1990
1990
Binary Space Partitioning Trees have several applications in computer graphics. We prove that there exist n-polygon problem… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1990
Highly Cited
1990
We consider schemes for recursively dividing a set of geometric objects by hyperplanes until all objects are separated. Such a… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 5
  • figure 6
Is this relevant?
Highly Cited
1990
Highly Cited
1990
A binary space parWon, or BSP, is a scheme for recursively dividing a configuration of objects by hyperplanes until all objects… (More)
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We introduce a new representation for polyhedra by showing how Binary Space Partitioning Trees (BSP trees) can be used to… (More)
  • figure I
  • figure 2
  • figure 3
Is this relevant?