Volume-Surface Trees

12 years 5 months ago
Volume-Surface Trees
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS3), such as octrees, kD-trees or BSP trees. Such HS3 usually provide an axis-aligned subdivision of the 3D space embedding a scene or an object. However, the purely volume-based behavior of these schemes often leads to strongly imbalanced surface clustering. In this article, we introduce the VS-Tree, an alternative HS3 providing efficient and accurate surface-based hierarchical clustering via a combination of a global 3D decomposition at coarse subdivision levels, and a local 2D decomposition at fine levels near the surface. First, we show how to efficiently construct VS-Trees over meshes and point-based surfaces, and analyze the improvement it offers for cluster-based surface simplification methods. Then we propose a new surface reconstruction algorithm based on the volume-surface classification of the VS-Tree. This new algorithm is faster than state-of-the-art reconstruct...
Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier,
Added 11 Dec 2010
Updated 11 Dec 2010
Type Journal
Year 2006
Where CGF
Authors Tamy Boubekeur, Wolfgang Heidrich, Xavier Granier, Christophe Schlick
Comments (0)