<?xml version="1.0" encoding="utf-8"?>
<TEI xmlns="http://www.tei-c.org/ns/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:hal="http://hal.archives-ouvertes.fr/" xmlns:gml="http://www.opengis.net/gml/3.3/" xmlns:gmlce="http://www.opengis.net/gml/3.3/ce" version="1.1" xsi:schemaLocation="http://www.tei-c.org/ns/1.0 http://api.archives-ouvertes.fr/documents/aofr-sword.xsd">
  <teiHeader>
    <fileDesc>
      <titleStmt>
        <title>HAL TEI export of hal-00330580v2</title>
      </titleStmt>
      <publicationStmt>
        <distributor>CCSD</distributor>
        <availability status="restricted">
          <licence target="https://creativecommons.org/publicdomain/zero/1.0/">CC0 1.0 - Universal</licence>
        </availability>
        <date when="2026-05-17T20:04:34+02:00"/>
      </publicationStmt>
      <sourceDesc>
        <p part="N">HAL API Platform</p>
      </sourceDesc>
    </fileDesc>
  </teiHeader>
  <text>
    <body>
      <listBibl>
        <biblFull>
          <titleStmt>
            <title xml:lang="en">Dissections, orientations, and trees, with applications to optimal mesh encoding and to random sampling</title>
            <author role="aut">
              <persName>
                <forename type="first">Eric</forename>
                <surname>Fusy</surname>
              </persName>
              <email type="md5">f1137f3c697539fd7c2f11170b76d55a</email>
              <email type="domain">inria.fr</email>
              <idno type="idhal" notation="numeric">839860</idno>
              <idno type="halauthorid" notation="string">205250-839860</idno>
              <affiliation ref="#struct-2071"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Dominique</forename>
                <surname>Poulalhon</surname>
              </persName>
              <email type="md5">c9581856fff888637a4e143c75940dd0</email>
              <email type="domain">liafa.jussieu.fr</email>
              <idno type="idhal" notation="numeric">854587</idno>
              <idno type="halauthorid" notation="string">167872-854587</idno>
              <affiliation ref="#struct-2071"/>
            </author>
            <author role="aut">
              <persName>
                <forename type="first">Gilles</forename>
                <surname>Schaeffer</surname>
              </persName>
              <email type="md5">f79febcfc06c78cad843318376f2f258</email>
              <email type="domain">lix.polytechnique.fr</email>
              <idno type="idhal" notation="string">gilles-schaeffer</idno>
              <idno type="idhal" notation="numeric">742245</idno>
              <idno type="halauthorid" notation="string">373-742245</idno>
              <idno type="ORCID">https://orcid.org/0000-0001-6073-8574</idno>
              <idno type="IDREF">https://www.idref.fr/131403869</idno>
              <affiliation ref="#struct-2071"/>
            </author>
            <editor role="depositor">
              <persName>
                <forename>Eric</forename>
                <surname>Fusy</surname>
              </persName>
              <email type="md5">c9da3aec18bcfc74cf1f0c57f971d130</email>
              <email type="domain">lix.polytechnique.fr</email>
            </editor>
          </titleStmt>
          <editionStmt>
            <edition n="v1">
              <date type="whenSubmitted">2008-10-14 19:20:15</date>
            </edition>
            <edition n="v2" type="current">
              <date type="whenSubmitted">2008-10-20 23:37:51</date>
              <date type="whenModified">2024-08-01 17:08:02</date>
              <date type="whenReleased">2008-10-21 08:35:28</date>
              <date type="whenProduced">2008-05</date>
              <date type="whenEndEmbargoed">2008-10-20</date>
              <ref type="file" target="https://hal.science/hal-00330580v2/document">
                <date notBefore="2008-10-20"/>
              </ref>
              <ref type="file" subtype="author" n="1" target="https://hal.science/hal-00330580v2/file/FPS-long.pdf" id="file-332422-191165">
                <date notBefore="2008-10-20"/>
              </ref>
              <ref type="externalLink" target="http://arxiv.org/pdf/0810.2608"/>
            </edition>
            <respStmt>
              <resp>contributor</resp>
              <name key="104054">
                <persName>
                  <forename>Eric</forename>
                  <surname>Fusy</surname>
                </persName>
                <email type="md5">c9da3aec18bcfc74cf1f0c57f971d130</email>
                <email type="domain">lix.polytechnique.fr</email>
              </name>
            </respStmt>
          </editionStmt>
          <publicationStmt>
            <distributor>CCSD</distributor>
            <idno type="halId">hal-00330580</idno>
            <idno type="halUri">https://hal.science/hal-00330580</idno>
            <idno type="halBibtex">fusy:hal-00330580</idno>
            <idno type="halRefHtml">&lt;i&gt;ACM Transactions on Algorithms&lt;/i&gt;, 2008, 4 (2), pp.Art.19</idno>
            <idno type="halRef">ACM Transactions on Algorithms, 2008, 4 (2), pp.Art.19</idno>
            <availability status="restricted">
              <licence target="https://about.hal.science/hal-authorisation-v1/">HAL Authorization<ref corresp="#file-332422-191165"/></licence>
            </availability>
          </publicationStmt>
          <seriesStmt>
            <idno type="stamp" n="X">École polytechnique</idno>
            <idno type="stamp" n="CNRS">CNRS - Centre national de la recherche scientifique</idno>
            <idno type="stamp" n="LIX" corresp="X">Laboratoire d'informatique de l'Ecole polytechnique</idno>
            <idno type="stamp" n="X-DEP-INFO">Département d'informatique de l’École polytechnique</idno>
            <idno type="stamp" n="LIX_EMC">Equipe modélisation combinatoire du laboratoire d'informatique de l'École Polytechnique</idno>
          </seriesStmt>
          <notesStmt>
            <note type="audience" n="2">International</note>
            <note type="popular" n="0">No</note>
            <note type="peer" n="1">Yes</note>
          </notesStmt>
          <sourceDesc>
            <biblStruct>
              <analytic>
                <title xml:lang="en">Dissections, orientations, and trees, with applications to optimal mesh encoding and to random sampling</title>
                <author role="aut">
                  <persName>
                    <forename type="first">Eric</forename>
                    <surname>Fusy</surname>
                  </persName>
                  <email type="md5">f1137f3c697539fd7c2f11170b76d55a</email>
                  <email type="domain">inria.fr</email>
                  <idno type="idhal" notation="numeric">839860</idno>
                  <idno type="halauthorid" notation="string">205250-839860</idno>
                  <affiliation ref="#struct-2071"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Dominique</forename>
                    <surname>Poulalhon</surname>
                  </persName>
                  <email type="md5">c9581856fff888637a4e143c75940dd0</email>
                  <email type="domain">liafa.jussieu.fr</email>
                  <idno type="idhal" notation="numeric">854587</idno>
                  <idno type="halauthorid" notation="string">167872-854587</idno>
                  <affiliation ref="#struct-2071"/>
                </author>
                <author role="aut">
                  <persName>
                    <forename type="first">Gilles</forename>
                    <surname>Schaeffer</surname>
                  </persName>
                  <email type="md5">f79febcfc06c78cad843318376f2f258</email>
                  <email type="domain">lix.polytechnique.fr</email>
                  <idno type="idhal" notation="string">gilles-schaeffer</idno>
                  <idno type="idhal" notation="numeric">742245</idno>
                  <idno type="halauthorid" notation="string">373-742245</idno>
                  <idno type="ORCID">https://orcid.org/0000-0001-6073-8574</idno>
                  <idno type="IDREF">https://www.idref.fr/131403869</idno>
                  <affiliation ref="#struct-2071"/>
                </author>
              </analytic>
              <monogr>
                <idno type="halJournalId" status="VALID">9521</idno>
                <idno type="issn">1549-6325</idno>
                <title level="j">ACM Transactions on Algorithms</title>
                <imprint>
                  <publisher>Association for Computing Machinery</publisher>
                  <biblScope unit="volume">4</biblScope>
                  <biblScope unit="issue">2</biblScope>
                  <biblScope unit="pp">Art.19</biblScope>
                  <date type="datePub">2008-05</date>
                </imprint>
              </monogr>
              <idno type="arxiv">0810.2608</idno>
            </biblStruct>
          </sourceDesc>
          <profileDesc>
            <langUsage>
              <language ident="en">English</language>
            </langUsage>
            <textClass>
              <keywords scheme="author">
                <term xml:lang="en">Bijection</term>
                <term xml:lang="en">Counting</term>
                <term xml:lang="en">Coding</term>
                <term xml:lang="en">Random generation</term>
              </keywords>
              <classCode scheme="classification">05A15</classCode>
              <classCode scheme="halDomain" n="math.math-co">Mathematics [math]/Combinatorics [math.CO]</classCode>
              <classCode scheme="halTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halOldTypology" n="ART">Journal articles</classCode>
              <classCode scheme="halTreeTypology" n="ART">Journal articles</classCode>
            </textClass>
            <abstract xml:lang="en">
              <p>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].</p>
            </abstract>
          </profileDesc>
        </biblFull>
      </listBibl>
    </body>
    <back>
      <listOrg type="structures">
        <org type="laboratory" xml:id="struct-2071" status="VALID">
          <idno type="IdRef">196509955</idno>
          <idno type="ISNI">0000000403673665</idno>
          <idno type="RNSR">200519331V</idno>
          <idno type="ROR">https://ror.org/04afed728</idno>
          <idno type="Wikidata">Q16009025</idno>
          <orgName>Laboratoire d'informatique de l'École polytechnique [Palaiseau]</orgName>
          <orgName type="acronym">LIX</orgName>
          <date type="start">2005-01-01</date>
          <desc>
            <address>
              <addrLine>1 Rue Honoré d’Estienne d’Orves, Bâtiment Alain Turing, 91120 Palaiseau</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.lix.polytechnique.fr/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-300340" type="direct"/>
            <relation active="#struct-563936" type="indirect"/>
            <relation name="UMR7161" active="#struct-441569" type="direct"/>
          </listRelation>
        </org>
        <org type="institution" xml:id="struct-300340" status="VALID">
          <idno type="IdRef">027309320</idno>
          <idno type="ISNI">0000000121581279</idno>
          <idno type="ROR">https://ror.org/05hy3tk52</idno>
          <idno type="Wikidata">Q273626</idno>
          <orgName>École polytechnique</orgName>
          <orgName type="acronym">X</orgName>
          <date type="start">1794-03-11</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91128 Palaiseau Cedex</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.polytechnique.edu/</ref>
          </desc>
          <listRelation>
            <relation active="#struct-563936" type="direct"/>
          </listRelation>
        </org>
        <org type="regroupinstitution" xml:id="struct-563936" status="VALID">
          <idno type="IdRef">238327159</idno>
          <idno type="ISNI">0000000502717600</idno>
          <idno type="ROR">https://ror.org/042tfbd02</idno>
          <idno type="Wikidata">Q48759778</idno>
          <orgName>Institut Polytechnique de Paris</orgName>
          <orgName type="acronym">IP Paris</orgName>
          <date type="start">2019-06-02</date>
          <desc>
            <address>
              <addrLine>Route de Saclay, 91120 Palaiseau Cedex, France</addrLine>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.ip-paris.fr</ref>
          </desc>
        </org>
        <org type="regroupinstitution" xml:id="struct-441569" status="VALID">
          <idno type="IdRef">02636817X</idno>
          <idno type="ISNI">0000000122597504</idno>
          <idno type="ROR">https://ror.org/02feahw73</idno>
          <orgName>Centre National de la Recherche Scientifique</orgName>
          <orgName type="acronym">CNRS</orgName>
          <date type="start">1939-10-19</date>
          <desc>
            <address>
              <country key="FR"/>
            </address>
            <ref type="url">https://www.cnrs.fr/</ref>
          </desc>
        </org>
      </listOrg>
    </back>
  </text>
</TEI>