Dissections, orientations, and trees, with applications to optimal mesh encoding and to random sampling - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue ACM Transactions on Algorithms Année : 2008

Dissections, orientations, and trees, with applications to optimal mesh encoding and to random sampling

Résumé

We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees, with interesting consequences for enumeration, mesh compression and graph sampling. Our bijection yields an efficient uniform random sampler for 3-connected planar graphs, which turns out to be determinant for the quadratic complexity of the current best known uniform random sampler for labelled planar graphs [{\bf Fusy, Analysis of Algorithms 2005}]. It also provides an encoding for the set $\mathcal{P}(n)$ of $n$-edge 3-connected planar graphs that matches the entropy bound $\frac1n\log_2|\mathcal{P}(n)|=2+o(1)$ bits per edge (bpe). This solves a theoretical problem recently raised in mesh compression, as these graphs abstract the combinatorial part of meshes with spherical topology. We also achieve the {optimal parametric rate} $\frac1n\log_2|\mathcal{P}(n,i,j)|$ bpe for graphs of $\mathcal{P}(n)$ with $i$ vertices and $j$ faces, matching in particular the optimal rate for triangulations. Our encoding relies on a linear time algorithm to compute an orientation associated to the minimal Schnyder wood of a 3-connected planar map. This algorithm is of independent interest, and it is for instance a key ingredient in a recent straight line drawing algorithm for 3-connected planar graphs [\bf Bonichon et al., Graph Drawing 2005].
Fichier principal
Vignette du fichier
FPS-long.pdf (1.03 Mo) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)

Dates et versions

hal-00330580 , version 1 (14-10-2008)
hal-00330580 , version 2 (20-10-2008)

Identifiants

Citer

Eric Fusy, Dominique Poulalhon, Gilles Schaeffer. Dissections, orientations, and trees, with applications to optimal mesh encoding and to random sampling. ACM Transactions on Algorithms, 2008, 4 (2), pp.Art.19. ⟨hal-00330580v2⟩
207 Consultations
191 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More