Show simple item record

Untitled

hal.structure.identifierVisualization and manipulation of complex data on wireless mobile devices [IPARLA]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorBOUBEKEUR, Tamy
hal.structure.identifierComputer Science Department [UBC-Computer Science]
dc.contributor.authorHEIDRICH, Wolfgang
hal.structure.identifierVisualization and manipulation of complex data on wireless mobile devices [IPARLA]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorGRANIER, Xavier
hal.structure.identifierVisualization and manipulation of complex data on wireless mobile devices [IPARLA]
hal.structure.identifierLaboratoire Bordelais de Recherche en Informatique [LaBRI]
dc.contributor.authorSCHLICK, Christophe
dc.date.accessioned2024-04-15T09:56:23Z
dc.date.available2024-04-15T09:56:23Z
dc.date.issued2006
dc.identifier.issn0167-7055
dc.identifier.urihttps://oskar-bordeaux.fr/handle/20.500.12278/198830
dc.description.abstractEnMany 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.
dc.language.isoen
dc.publisherWiley
dc.typeArticle de revue
dc.identifier.doi10.1111/j.1467-8659.2006.00959.x
dc.subject.halInformatique [cs]/Géométrie algorithmique [cs.CG]
bordeaux.journalComputer Graphics Forum
bordeaux.page399-406
bordeaux.volume25
bordeaux.hal.laboratoriesLaboratoire Bordelais de Recherche en Informatique (LaBRI) - UMR 5800*
bordeaux.issue3
bordeaux.institutionUniversité de Bordeaux
bordeaux.institutionBordeaux INP
bordeaux.institutionCNRS
bordeaux.peerReviewedoui
hal.identifierinria-00187194
hal.version1
hal.popularnon
hal.audienceInternationale
hal.origin.linkhttps://hal.archives-ouvertes.fr//inria-00187194v1
bordeaux.COinSctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Computer%20Graphics%20Forum&rft.date=2006&rft.volume=25&rft.issue=3&rft.spage=399-406&rft.epage=399-406&rft.eissn=0167-7055&rft.issn=0167-7055&rft.au=BOUBEKEUR,%20Tamy&HEIDRICH,%20Wolfgang&GRANIER,%20Xavier&SCHLICK,%20Christophe&rft.genre=article


Files in this item

FilesSizeFormatView

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record