Untitled
BOUBEKEUR, Tamy
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
GRANIER, Xavier
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
See more >
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
BOUBEKEUR, Tamy
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
GRANIER, Xavier
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
SCHLICK, Christophe
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
< Reduce
Visualization and manipulation of complex data on wireless mobile devices [IPARLA]
Laboratoire Bordelais de Recherche en Informatique [LaBRI]
Language
en
Article de revue
This item was published in
Computer Graphics Forum. 2006, vol. 25, n° 3, p. 399-406
Wiley
English Abstract
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 ...Read more >
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.Read less <
Origin
Hal imported