Computing the Boundary of a Class of Labeled-Leaf BSP Solids
or how to compute concise watertight z-fail shadow volumes
Abstract
We describe an algorithm that computes the boundary of the shadow
volume cast by a collection of piecewise linear polyhedra in space
using BSP trees. Unlike boundary representations, representing solids
in general and shadow volumes in particular using BSP trees makes it
possible to implement boolean operations easily and robustly. Also,
in contrast with operating in Constructive Solid Geometry or on Nef
polyhedra, no neighborhood analysis is needed.
with Chris Smith
Files
back
We describe an algorithm that computes the boundary of the shadow
volume cast by a collection of piecewise linear polyhedra in space
using BSP trees. Unlike boundary representations, representing solids
in general and shadow volumes in particular using BSP trees makes it
possible to implement boolean operations easily and robustly. Also,
in contrast with operating in Constructive Solid Geometry or on Nef
polyhedra, no neighborhood analysis is needed.