Volume-Surface Trees
dc.contributor.author | Boubekeur, Tamy | en_US |
dc.contributor.author | Heidrich, Wolfgang | en_US |
dc.contributor.author | Granier, Xavier | en_US |
dc.contributor.author | Schlick, Christophe | en_US |
dc.date.accessioned | 2015-02-21T14:31:15Z | |
dc.date.available | 2015-02-21T14:31:15Z | |
dc.date.issued | 2006 | en_US |
dc.description.abstract | 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 reconstruction methods and provides a final semi-regular mesh comparable to the output of remeshing algorithms. | en_US |
dc.description.number | 3 | en_US |
dc.description.seriesinformation | Computer Graphics Forum | en_US |
dc.description.volume | 25 | en_US |
dc.identifier.doi | 10.1111/j.1467-8659.2006.00959.x | en_US |
dc.identifier.issn | 1467-8659 | en_US |
dc.identifier.pages | 399-406 | en_US |
dc.identifier.uri | https://doi.org/10.1111/j.1467-8659.2006.00959.x | en_US |
dc.publisher | The Eurographics Association and Blackwell Publishing, Inc | en_US |
dc.title | Volume-Surface Trees | en_US |