Using Separating Planes between Objects for Efficient Hidden Surface Removal

This paper describes a new technique for generation of binary space partition trees representing polyhedral objects and outlines an efficient algorithm for operations such as composition, deletion and motion of objects. We assume a modified version of BSP trees with all the polygon fragments lying at the leaf nodes described in [9]. The eciency of merging algorithm for two BSP trees depends on the separability of the polyhedras represented by them. We aim to achieve efficiency by use of an...