Bounding-planes Octree: A new volume-based LOD scheme

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.

[1]  Miguel Chover,et al.  Variable Resolution Level-of-Detail of Multiresolution Ordered Meshes , 2001, WSCG.

[2]  Hugues Hoppe,et al.  Progressive meshes , 1996, SIGGRAPH.

[3]  Paolo Cignoni,et al.  External Memory Management and Simplification of Huge Meshes , 2003, IEEE Trans. Vis. Comput. Graph..

[4]  Joseph S. B. Mitchell,et al.  Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs , 1998, IEEE Trans. Vis. Comput. Graph..

[5]  Gino van den Bergen.  Efficient Collision Detection of Complex Deformable Models using AABB Trees , 1997, J. Graphics, GPU, & Game Tools.

[6]  Hugues Hoppe,et al.  View-dependent refinement of progressive meshes , 1997, SIGGRAPH.

[7]  Pere Brunet,et al.  Object representation by means of nonminimal division quadtrees and octrees , 1985, TOGS.

[8]  Dinesh Manocha,et al.  OBBTree: a hierarchical structure for rapid interference detection , 1996, SIGGRAPH.

[9]  David Salesin,et al.  Fast Rendering of Complex Environments Using a Spatial Hierarchy , 1996, Graphics Interface.

[10]  Pedro Cano,et al.  Combining SP-Octrees and impostors for the visualisation of multiresolution models , 2005, Comput. Graph..

[11]  Takayuki Tanaka,et al.  ARTS: Accelerated Ray-Tracing System , 1986, IEEE Computer Graphics and Applications.

[12]  Pedro Cano,et al.  Progressive Transmission of Polyhedral Solids Using a Hierarchical Representation Scheme , 2003, WSCG.

[13]  Ingrid Carlbom,et al.  A Hierarchical Data Structure for Representing the Spatial Decomposition of 3-D Objects , 1985, IEEE Computer Graphics and Applications.

[14]  James H. Clark,et al.  Hierarchical geometric models for visible surface algorithms , 1976, CACM.

[15]  Peter J. Rousseeuw,et al.  Finding Groups in Data: An Introduction to Cluster Analysis , 1990 .

[16]  Ioana M. Martin.  ARTE—an adpative rendering and transmission environment for 3D graphics , 2000, MM 2000.

[17]  William V. Baxter,et al.  HLODs for faster display of large static and dynamic environments , 2001, I3D '01.

[18]  Philip M. Hubbard,et al.  Approximating polyhedra with spheres for time-critical collision detection , 1996, TOGS.

[19]  Paolo Cignoni,et al.  Visualization and 3D data processing in the David restoration , 2004, IEEE Computer Graphics and Applications.