Binary space partitioning trees: a multiresolution approach

Abstract

Space partitioning techniques are a useful means of organizing geometric models into data structures. Such data structures provide easy and efficient access to a wide range of computer graphics and visualization applications like real time rendering of large databases, collision detection, point classification, etc. Binary space partitioning (BSP) trees are one of the most successful space partitioning techniques, since they allow both object modeling and classification in one single structure. However, with the advent of networked graphics applications, there is an increasing need for multiresolution geometric representations. The paper presents a novel method that extends BSP trees to provide such a representation. The models we present have the advantages of both BSP trees and multiresolution representations. Nodes near the root of the BSP tree store coarser versions of the geometry, while leaf nodes provide the finest details of the representation. We present different algorithms to construct multiresolution BSP trees in 2D. Then we propose extensions of our methods to 3D space.