Volume-Surface Trees

Simple item page
dc.contributor.authorBoubekeur, Tamyen_US
dc.contributor.authorHeidrich, Wolfgangen_US
dc.contributor.authorGranier, Xavieren_US
dc.contributor.authorSchlick, Christopheen_US
dc.date.accessioned2015-02-21T14:31:15Z
dc.date.available2015-02-21T14:31:15Z
dc.date.issued2006en_US
dc.description.abstractMany 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.number3en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume25en_US
dc.identifier.doi10.1111/j.1467-8659.2006.00959.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages399-406en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2006.00959.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing, Incen_US
dc.titleVolume-Surface Treesen_US
Files
Collections
25-Issue 3