Optimal encoding of triangular and quadrangular meshes with fixed topology

Abstract : Extending a bijection recently introduced by Poulalhon and Schaeffer [Icalp 2003] for triangulations of the sphere we design an efficient algorithm for encoding (topological) triangulations and bipartite quadrangulations on an orientable surface of fixed topology τ (given by the genus g and number of boundaries b). To our knowledge, our encoding procedure is the first to be asymptotically optimal (in the information theory sense) with respect to two natural parameters, the number n of inner vertices and the number k of boundary vertices.
Type de document :
Communication dans un congrès
22nd Annual Canadian Conference on Computational Geometry, Aug 2010, Winnipeg, Canada. 2010, 〈http://cccg.ca/proceedings/2010/paper27.pdf〉
Liste complète des métadonnées

Littérature citée [17 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/hal-00709972
Contributeur : Luca Castelli Aleardi <>
Soumis le : mardi 19 juin 2012 - 17:19:04
Dernière modification le : jeudi 10 mai 2018 - 02:06:51
Document(s) archivé(s) le : jeudi 20 septembre 2012 - 02:41:28

Fichier

OptimalTriangleQuadMeshes_CCCG...
Fichiers éditeurs autorisés sur une archive ouverte

Identifiants

  • HAL Id : hal-00709972, version 1

Collections

Citation

Luca Castelli Aleardi, Eric Fusy, Thomas Lewiner. Optimal encoding of triangular and quadrangular meshes with fixed topology. 22nd Annual Canadian Conference on Computational Geometry, Aug 2010, Winnipeg, Canada. 2010, 〈http://cccg.ca/proceedings/2010/paper27.pdf〉. 〈hal-00709972〉

Partager

Métriques

Consultations de la notice

147

Téléchargements de fichiers

47