Volume and complexity bounded simplification of solid model represented by binary space partition

We present a volume and complexity bounded solid simplification of models represented by Binary Space Partition (BSP). Depending on the compact and robust representation of a solid model in BSP-tree, the boundary surface of a simplified model is guaranteed to be watertight and self-intersection free. Two techniques are investigated in this paper. The volume bounded convex simplification can collapse parts with small volumes on the model into a simple convex volume enclosing the volumetric cells on the input model. The selection of which region to simplify is based on a volume-difference metric, with the help of which the volume difference between the given model and the simplified one is minimized. Another technique is a plane collapse method which reduces the depth of the BSP-tree. These two techniques are integrated into our solid simplification algorithm to give satisfactory results.