Volume-Surface Trees
No Thumbnail Available
Date
2006
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association and Blackwell Publishing, Inc
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.
Description
@article{10.1111:j.1467-8659.2006.00959.x,
journal = {Computer Graphics Forum},
title = {{Volume-Surface Trees}},
author = {Boubekeur, Tamy and Heidrich, Wolfgang and Granier, Xavier and Schlick, Christophe},
year = {2006},
publisher = {The Eurographics Association and Blackwell Publishing, Inc},
ISSN = {1467-8659},
DOI = {10.1111/j.1467-8659.2006.00959.x}
}