Premium
Volume‐Surface Trees
Author(s) -
Boubekeur Tamy,
Heidrich Wolfgang,
Granier Xavier,
Schlick Christophe
Publication year - 2006
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/j.1467-8659.2006.00959.x
Subject(s) - polygon mesh , subdivision , computer science , subdivision surface , surface (topology) , cluster analysis , embedding , computer graphics , tree (set theory) , volume (thermodynamics) , point (geometry) , decomposition , algorithm , k d tree , computer graphics (images) , artificial intelligence , mathematics , tree traversal , geometry , combinatorics , geography , ecology , physics , archaeology , quantum mechanics , biology
Many algorithms in computer graphics improve their efficiency by using Hierarchical Space Subdivision Schemes (HS 3 ), such as octrees, kD‐trees or BSP trees. Such HS 3 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 HS 3 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 reconstruction methods and provides a final semi‐regular mesh comparable to the output of remeshing algorithms .