| | |
Summary: /^
@
'V,t
ComputerGraphics,Volume24.Numoe..1 l -:-.'
MergingBSPTreesYieldsPolyhedralSetOperations
BruceNaylor*.JohnAmanatidestandWilliamThibaultf
*AT& T BellLaboratories
tYorkUniversity
tCaliforniaStateUniversitvatHavward
.{bstract
BSP trees have been shown to provide an effective repre-
tentation of polyhedra through the use of spatial subdivision,
;nd are an alternative to the topologically based b-reps. While
?sptree algorithms are knownfor a number of important opera-
:ions, such as rendering, no previous work on bsp trees has
trovided the capability of performing boolean set operations
tetween two objects represented by bsp trees, i.e. there has
leen no closed boolean algebra when using bsp lrees. This pa-
.er presents the algorithms required to perform such opera-
:ions. In doing so, a distinction is made between the semantics
|
