Image compression using binary space partitioning trees

Multiresolution modeling using binary space partitioning trees

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 data bases, collision detection, point classification, etc. Binary Space Partitioning BSP trees are one of the most successful space p...

Binary Space Partitioning (BSP) Trees

A binary space partitioning (bsp) tree represents a recursive, hierarchical subdivision of d-dimensional space into convex subspaces. BSP trees provide a computational representation of space that provides both a search structure and a representation of geometry. Constructing a bsp tree consists of partitioning a subspace by means of a hyperplane, which intersects the interior of that subspace,...

Progressive Image Compression Using Binary Trees

In this paper, we present an approach of using binary tree structures for efficient progressive image compression. General ideas of progressive transmission and image approximation are discussed. We also present a specific technique, which provides compression ratios comparable to the ratios of the best algorithms known in the literature. Besides, it is computationally simple and specially desi...

A Tutorial on Binary Space Partitioning Trees

Binary space partitioning trees: a multiresolution approach

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 data bases, collision detection, point classification, etc. Binary Space Partitioning (BSP) trees are one of the most successful space par...