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

@inproceedings{Fusy2005DissectionsAT,
  title={Dissections and trees, with applications to optimal mesh encoding and to random sampling},
  author={{\'E}ric Fusy and Dominique Poulalhon and Gilles Schaeffer},
  booktitle={SODA},
  year={2005}
}
We present a bijection between some quadrangular dissections of an hexagon and unrooted binary trees. This correspondence has interesting consequences for enumeration, mesh compression and random graph sampling.It yields a succinct representation for the set <i>P(n)</i> of <i>n</i>-edge 3-connected planar graphs matching the entropy bound 1/<i>n</i> log |<i>P</i>(<i>n</i>)| = 2+<i>o</i>(1) bits per edge. This solves a theoretical problem in mesh compression, as these graphs abstract the… CONTINUE READING
49 Citations
3 References
Similar Papers

References

Publications referenced by this paper.
Showing 1-3 of 3 references

The number of three-dimensional convex polyhedra

  • E. A. Bender
  • Amer. Math. Monthly, 94(1):7–21
  • 1987
Highly Influential
2 Excerpts

Similar Papers

Loading similar papers…