Object representation by means of nonminimal division quadtrees and octrees
ACM Transactions on Graphics (TOG)
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
Fast rendering of complex environments using a spatial hierarchy
GI '96 Proceedings of the conference on Graphics interface '96
View-dependent refinement of progressive meshes
Proceedings of the 24th annual conference on Computer graphics and interactive techniques
Hierarchical geometric models for visible surface algorithms
Communications of the ACM
HLODs for faster display of large static and dynamic environments
I3D '01 Proceedings of the 2001 symposium on Interactive 3D graphics
ARTE—an adpative rendering and transmission environment for 3D graphics
MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Efficient collision detection of complex deformable models using AABB trees
Journal of Graphics Tools
External Memory Management and Simplification of Huge Meshes
IEEE Transactions on Visualization and Computer Graphics
A Hierarchical Data Structure for Representing the Spatial Decomposition of 3-D Objects
IEEE Computer Graphics and Applications
Combining SP-Octrees and impostors for the visualisation of multiresolution models
Computers and Graphics
| Hi-index | 0.00 |
In this paper we present a new data structure: the BP-Octree (Bounding-planes Octree). The BP-Octree is based on a spatial decomposition of the model using an octree, and offers a very tight hierarchy of convex bounding volumes which leads to simplified models. It is done by assigning to each node of the tree a set of planes that, intersected one among others, creates a bounding volume of the part of the model contained in that node. These planes are taken from the real polygons of the model, and are selected at each level guaranteeing that they include completely all boundings of deeper levels. By using this scheme, it is possible to achieve several tasks apart from the inherent collision detection algorithms, such as the progressive transmission of the bounding volume by sending the planes coefficients needed at each level-just the index of each plane if it has been previously transmitted. On the client side, the visualization algorithm is responsible for reconstructing the polygonal geometry from the set of planes just applying a mesh clipping algorithm.