CAD
2008
Springer
13 years 8 months ago
2008
Springer
This paper presents a new method for evaluating boolean set operations between Binary Space Partition (BSP) trees. Our algorithm has many desirable features including both numeric...
SODA
2003
ACM
13 years 10 months ago
2003
ACM
We consider the following question: Given a subdivision of space into n convex polyhedral cells, what is the worst-case complexity of a binary space partition (BSP) for the subdiv...
COMPGEOM
1997
ACM
14 years 22 days ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
IMR
2003
Springer
14 years 1 months ago
2003
Springer
In this paper we tackle the problem of tetrahedralization by breaking non-convex polyhedra into convex subpolyhedra, tetrahedralizing these convex subpolyhedra and merging them to...
SIBGRAPI
2006
IEEE
14 years 2 months ago
2006
IEEE
This work introduces a new compression scheme for point sets. This scheme relies on an adaptive binary space partition (BSP) which takes into account the geometric structure of the...
COMPGEOM
2009
ACM
14 years 3 months ago
2009
ACM
A binary space partition (BSP) for a set of disjoint objects in Euclidean space is a recursive decomposition, where each step partitions the space (and some of the objects) along ...