Merging BSP trees yields polyhedral set operations

BSP trees have been shown to provide an effective representation of polyhedra through the use of spatial subdivision, and are an alternative to the topologically based b-reps. While bsp tree algorithms are known for a number of important operations, such as rendering, no previous work on bsp trees has provided the capability of performing boolean set operations between two objects represented by bsp trees, i.e. there has been no closed boolean algebra when using bsp trees. This paper presents the algorithms required to perform such operations. In doing so, a distinction is made between the semantics of polyhedra and the more fundamental mechanism of spatial partitioning. Given a partitioning of a space, a particular semantics is induced on the space by associating attributes required by the desired semantics with the cells of the partitioning. So, for example, polyhedra are obtained simply by associating a boolean attribute with each cell. Set operations on polyhedra are then constructed on top of the operation of merging spatial partitionings. We present then the algorithm for merging two bsp trees independent of any attributes/semantics, and then follow this by the additional algorithmic considerations needed to provide set operations on polyhedra. The result is a simple and numerically robust algorithm for set operations.

[1]  Bruce F. Naylor.  Binary space partitioning trees as an alternative representation of polytopes , 1990, Comput. Aided Des..

[2]  Steven K. Feiner,et al.  Near real-time shadow generation using BSP trees , 1989, SIGGRAPH '89.

[3]  F. Frances Yao,et al.  Binary partitions with applications to hidden surface removal and solid modelling , 1989, SCG '89.

[4]  M. Karasick.  On the representation and manipulation of rigid solids , 1989 .

[5]  F. Frances Yao,et al.  Optimal binary space partitions for orthogonal objects , 1990, SODA '90.

[6]  F NaylorBruce,et al.  Set operations on polyhedra using binary space partitioning trees , 1987 .

[7]  R. Schmacher,et al.  Study for Applying Computer-Generated Images to Visual Simulation: (510842009-001) , 1969 .

[8]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling: An Introduction , 1989 .

[9]  Bruce F. Naylor.  SCULPT: an interactive solid modeling tool , 1990 .

[10]  Henry Fuchs,et al.  On visible surface generation by a priori tree structures , 1980, SIGGRAPH '80.

[11]  Christoph M. Hoffmann,et al.  Geometric and Solid Modeling , 1989 .

[12]  Donald S. Fussell,et al.  Adaptive mesh generation for global diffuse illumination , 1990, SIGGRAPH.

[13]  Bruce F. Naylor,et al.  Set operations on polyhedra using binary space partitioning trees , 1987, SIGGRAPH.

[14]  W. C. Thibault,et al.  Application of binary space partitioning trees to geometric modeling and ray-tracing , 1987 .

[15]  B. Naylor.  A priori based techniques for determining visibility priority for 3-d scenes , 1981 .

[16]  Enric Torres,et al.  Optimization of the Binary Space Partition Algorithm (BSP) for the Visualization of Dynamic Scenes , 1990, Eurographics.

[17]  E SutherlandIvan,et al.  A Characterization of Ten Hidden-Surface Algorithms , 1974 .