Éric Fusy
Skip Abstract Section
Abstract
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. It also provides an encoding for the set P(n) of n-edge 3-connected planar graphs that matches the entropy bound 1/n log2 |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 1/n log2 |P(n, i, j)| bpe for graphs of 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 with 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.
- Alliez, P. and Gotsman, C. 2003. Recent advances in compression of 3D meshes. In Proceedings of the Symposium on Multiresolution in Geometric Modeling. http://www.inria.fr/rrrt/rr-4966.Google Scholar
- Ambjørn, J., Bialas, P., Burda, Z., Jurkiewicz, J., and Petersson, B. 1994. Sampling of random surfaces by baby universe surgery. Phys. Lett. B 325, 337--346.Google ScholarCross Ref
- di Battista, G., Tamassia, R., and Vismara, L. 1999. Output-sensitive reporting of disjoint paths. Algorithmica 23, 3, 302--340.Google ScholarCross Ref
- Bender, E. A. 1987. The number of three-dimensional convex polyhedra. Amer. Math. Month. 94, 1, 7--21. Google ScholarDigital Library
- Bodirsky, M., Gröpl, C., and Kang, M. 2003. Generating labeled planar graphs uniformly at random. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP'03). Eindhoven, The Netherlands. 1095--1107. Google ScholarDigital Library
- Bonichon, N., Felsner, S., and Mosbah, M. 2007. Convex drawings of 3-connected planar graphs. Algorithmica 47, 4, 399--420. Google ScholarDigital Library
- Bonichon, N., Gavoille, C., and Hanusse, N. 2003. An information-theoretic upper bound of planar graphs using triangulations. In Proceedings of the Annual Symposium on Theoretical Aspects of Computer Science (STACS'03), 499--510. Google ScholarDigital Library
- Bouttier, J., di Francesco, P., and Guitter, E. 2002. Census of planar maps: from the one-matrix solution to a combinatorial proof. Nucl. Phys. B 645, 477--499.Google ScholarCross Ref
- Brehm, E. 2000. 3-orientations and Schnyder 3-tree-decompositions. M.S. thesis, Freie Universität Berlin, Germany. http://www.tu-berlin.de/ ~felsner/Diplomarbeiten/brehm.ps.gz.Google Scholar
- Brown, W. 1964. Enumeration of triangulations of the disk. In Proceedings of the London Mathematical Society. 746--768.Google ScholarCross Ref
- Castelli-Aleardi, L. and Devillers, O. 2004. Canonical triangulation of a graph, with a coding application. http://www.inria.fr/rrrt/rr-5231.html.Google Scholar
- Castelli-Aleardi, L., Devillers, O., and Schaeffer, G. 2006. Optimal succinct representations of planar maps. In Proceedings of ACM Symposium on Computational Geometry (SoCG'06), Sedona, AZ. ACM Press, 309--318. Google ScholarDigital Library
- Chuang, R. C.-N., Garg, A., He, X., Kao, M.-Y., and Lu, H.-I. 1998. Compact encodings of planar graphs via canonical orderings. In Proceedings of the International Colloquium on Automata, Languages, and Programming (ICALP'98), Aalborg, Denmark. Google ScholarDigital Library
- Denise, A., Vasconcellos, M., and Welsh, D. J. A. 1996. The random planar graph. Congr. Numer. 113, 61--79.Google Scholar
- Duchon, P., Flajolet, P., Louchard, G., and Schaeffer, G. 2004. Boltzmann samplers for the random generation of combinatorial structures. Combinatorics Probab. Comput. (Special Issue on Analysis of Algorithms.) 13, 4--5, 577--625. Google ScholarDigital Library
- Felsner, S. 2001. Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18, 19--37.Google ScholarCross Ref
- Felsner, S. 2004. Lattice structures for planar graphs. Electron. J. Comb. 11, 1.Google Scholar
- Flajolet, P., Zimmermann, P., and Van Cutsem, B. 1994. A calculus for random generation of combinatorial structures. Theoret. Comput. Sci. 132, 2, 1--35. Google ScholarDigital Library
- de Fraysseix, H., Ossona de Mendez, P., and Rosenstiehl, P. Pigale, Automatic Graph Drawing. http://sourceforge.org/pigale/.Google Scholar
- Fusy, É. 2005. Quadratic exact size and linear approximate size random generation of planar graphs. Discr. Math. Theor. Comput. Sci. AD, 125--138.Google Scholar
- Gessel, I. 1992. Super ballot numbers. J. Symb. Comput. 14, 2/3, 179--194. Google ScholarDigital Library
- Gotsman, C. 2003. On the optimality of valence-based connectivity coding. Comput. Graph. Foru., 99--102.Google Scholar
- He, X., Kao, M.-Y., and Lu, H.-I. 1999. Linear-time succinct encodings of planar graphs via canonical orderings. SIAM J. Discr. Math. 12, 3, 317--325. Google ScholarDigital Library
- He, X., Kao, M.-Y., and Lu, H.-I. 2000. A fast general methodology for information-theoretically optimal encodings of graphs. SIAM J. Comput 30, 3, 838--846. Google ScholarDigital Library
- Kant, G. 1996. Drawing planar graphs using the canonical ordering. Algorithmica 16, 4--32. (also FOCS'92).Google ScholarCross Ref
- Khodakovsky, A., Alliez, P., Desbrun, M., and Schröder, P. 2002. Near-optimal connectivity encoding of polygon meshes. Graph. Model 64, 3--4. Google ScholarDigital Library
- Khuller, S., Naor, J., and Klein, P. N. 1993. The lattice structure of flow in planar graphs. SIAM J. Discr. Math. 6, 3 477--490. Google ScholarDigital Library
- Lu, H.-I. 2002. Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. In Proceedings of Symposium on Discrete Algorithms (SODA'02), San Francisco, CA. ACM Press, 223--224. Google ScholarDigital Library
- McDiarmid, C., Steger, A., and Welsh, D. 2005. Random planar graphs. J. Combin. Theory, Series B 93, 187--205. Google ScholarDigital Library
- Mullin, R. and Schellenberg, P. 1968. The enumeration of c-nets via quadrangulations. J. Combin. Theory 4, 259--276.Google ScholarCross Ref
- Munro, J. I. and Raman, V. 1997. Succinct representation of balanced parentheses, static trees and planar graphs. In Proceedings of Annual Symposium on Foundations of Computer Science (FOCS'97), Miami, FL. ACM Press, 118--126. Google ScholarDigital Library
- Nijenhuis, A. and Wilf, H. S. 1978. Combinatorial Algorithms, 2nd Ed. Academic Press.Google Scholar
- Ossona de Mendez, P. 1994. Orientations bipolaires. Ph.D. thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, France.Google Scholar
- Osthus, D., Prömel, H. J., and Taraz, A. 2003. On random planar graphs, their number and their triangulations. J. Combin. Theory Ser. B 88, 1, 119--134. Google ScholarDigital Library
- Poulalhon, D. and Schaeffer, G. 2006. Optimal coding and sampling of triangulations. Algorithmica 46(3-4), 505--527. Google ScholarDigital Library
- Rossignac, J. 1999. Edgebreaker: Connectivity compression for triangle meshes. IEEE Trans. Visualiz. Comput. Graph. 5, 1, 47--61. Google ScholarDigital Library
- Schaeffer, G. 1997. Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees. Electron. J. Combin. 4, 1, # 20, 14 pp.Google ScholarCross Ref
- Schaeffer, G. 1999. Random sampling of large planar maps and convex polyhedra. In Proceedings of ACM Symposium on the Theory of Computing (STOC'99), Atlanta, CA. ACM Press, 760--769. Google ScholarDigital Library
- Schnyder, W. 1990. Embedding planar graphs on the grid. In Proceedings of Symposium on Discrete Algorithms (SODA'90), San Francisco, CA. ACM Press, 138--148. Google ScholarDigital Library
- Touma, C. and Gotsman, C. 1998. Triangle mesh compression. In Graphic Interface Conference 26--34.Google Scholar
- Tutte, W. T. 1962. A census of planar triangulations. Canad. J. Math. 14, 21--38.Google ScholarCross Ref
- Tutte, W. T. 1963. A census of planar maps. Canad. J. Math. 15, 249--271.Google ScholarCross Ref
- Whitney, H. 1933. 2-isomorphic graphs. Amer. J. Math. 54, 245--254.Google ScholarCross Ref
- Wilson, D. B. 1997. Determinant algorithms for random planar structures. In Proceedings of Symposium on Discrete Algorithms (SODA'97), New Orleans, LA. ACM Press, 258--267. Google ScholarDigital Library
- Wilson, D. B. 2004. An annotated bibliography of perfectly random sampling with markov chains. http://dimacs.rutgers.edu/~ dbwilson/exact.Google Scholar
Index Terms
- Dissections, orientations, and trees with applications to optimal mesh encoding and random sampling
Recommendations
Dissections and trees, with applications to optimal mesh encoding and to random sampling
SODA '05: Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithmsWe 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 ...
Random generation and enumeration of bipartite permutation graphs
Connected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the number, a simple algorithm that generates a connected bipartite permutation ...
Random Generation and Enumeration of Bipartite Permutation Graphs
ISAAC '09: Proceedings of the 20th International Symposium on Algorithms and ComputationConnected bipartite permutation graphs without vertex labels are investigated. First, the number of connected bipartite permutation graphs of n vertices is given. Based on the number, a simple algorithm that generates a connected bipartite permutation ...
Comments