BOUBEKEUR, Tamy; HEIDRICH, Wolfgang; GRANIER, Xavier; SCHLICK, Christophe

doi:10.1111/j.1467-8659.2006.00959.x

Métadonnées

Licence d’utilisation du document

BOUBEKEUR, Tamy
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]

HEIDRICH, Wolfgang
Computer Science Department [UBC-Computer Science]

GRANIER, Xavier
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]

Langue

Article de revue

Ce document a été publié dans

Computer Graphics Forum. 2006, vol. 25, n° 3, p. 399-406

Wiley

Résumé en anglais

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 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.< Réduire

Métadonnées

Partager cette publication !

Licence d’utilisation du document

[Sans titre]

Langue

Ce document a été publié dans

Résumé en anglais

URI

DOI

Origine

Unités de recherche