Optimal coding and sampling of triangulations

Algorithmica (New York)

Volumn 46, Issue 3-4, 2006, Pages 505-527

  Poulalhon, Dominique ^a   Schaeffer, Gilles ^b  

^a UNIVERSITÉ PARIS DIDEROT   (France)

^b ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Bijection; Enumeration; Orientations; Schnyder trees

Indexed keywords

ENUMERATION; PLANE TRIANGULATIONS; POLYGONS; SCHNYDER TREES;

ALGORITHMS; ENCODING (SYMBOLS); SET THEORY;

TREES (MATHEMATICS);

EID: 33846889519     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-006-0114-8     Document Type: Conference Paper

References (40)

1. M.E. Agishtein and A.A. Migdal. Geometry of a two-dimensional quantum gravity: numerical study. Nuclear Phys. B, 350:690-728, 1991.
2. L. Alonso, J.-L. Remy, and R. Schott. A linear-time algorithm for the generation of trees. Algorithmica, 17(2):162-183, 1997.
3. J. Ambjørn, P Bialas, Z. Burda, J. Jurkiewicz, and B. Petersson. Effective sampling of random surfaces by baby universe surgery. Phys. Lett. B, 325:337-346, 1994.
4. J. Ambjørn, B. Durhuus, and T. Jonsson. Quantum Geometry. Cambridge Monographs on Mathematical Physics. Cambridge University Press, Cambridge, 1997.
5. C. Banderier, P. Flajolet, G. Schaeffer, and M. Soria. Planar maps and Airy phenomena. In Proc. ICALP, pages 388-402, 2000.
6. N. Bonichon. A bijection between realizers of maximal plane graphs and pairs of non-crossing dyck paths. In Proc. FPSAC, 2002.
7. N. Bonichon, C. Gavoille, and N. Hanusse. An information-theoretic upper bound of planar graphs using triangulation. In Proc. STACS, 2003.
8. N. Bonichon, B. Le Saëc, and M. Mosbah. Wagner's theorem on realizers. In Proc. ICALP, pages 1043-1053, 2002.
9. M. Bousquet-Melou and G. Schaeffer. The degree distribution in bipartite planar maps: applications to theIsing model. 2002, arXiv:math.CO/0211070.
10. E. Brehm. 3-Orientations and Schnyder 3-tree-decompositions. Master's thesis, FB Mathematik und Informatik, Freie Universität Berlin, 2000.
11. W. Brown. Enumeration of triangulations of the disk. Proc. London Math. Soc. (3), 14:746-768, 1964.
12. L. Castelli Aleardi, O. Devillers, and G. Schaeffer. Succinct representation of triangulations with a boundary. In Proc. WADS, pages 139-195. LNCS 3608, Springer, Berlin, 2005.
13. R. C.-N. Chuang, A. Garg, X. He, M.-Y. Kao, and H.-I Lu. Compact encodings of planar graphs via canonical orderings. In Proc. ICALP, pages 118-129, 1998.
14. H. de Fraysseix and P. Ossona de Mendez. Regular orientations, arboricity and augmentation. In Proc. Graph Drawing, pages 111-118. LNCS 894, Springer, Berlin, 1995.
15. P. Duchon, P. Flajolet, G. Louchard, and G. Schaeffer. Random sampling from boltzmann principles. In Proc. ICALP, pages 501-513, 2002.
16. A. Dvoretzky and Th. Motzkin. The asymptotic density of certain sets of real numbers. Duke Math. J., 14:315-321, 1947.
17. S. Felsner. Convex drawings of planar graphs and the order dimension of 3-poly topes. Order, 18:19-37, 2001.
18. S. Felsner. Lattice structures from planar graphs. Electron. J. Combin., 11:#15, 24 pp., 2004.
19. P. Flajolet, P. Zimmermann, and B. Van Cutsem. A calculus for random generation of labelled combinatorial structures. Theoret. Comput. Sci., 132(2):1-35, 1994.
20. E. Fusy, D. Poulalhon, and G. Schaeffer. Dissections and trees, with applications to optimal mesh encoding and to random sampling. In Proc. SODA, pages 690-699, 2005.
21. P.-M. Gandoin and O. Devillers. Progressive lossless compression of arbitrary simplicial complexes. ACM Trans. Gmphics, 21(3):372-379, 2002.
22. Z. Gao and J. Wang. Enumeration of rooted planar triangulations with respect to diagonal flips. J. Combin. Theory Ser: A, 88(2):276-296, 1999.
23. O. Gimenez and M. Noy. Asymptotic enumeration and limit law of labelled planar graphs. Preprint available on arXiv.org,2005.
24. X. He, M.-Y. Kao, and H.-I. Lu. Linear-time succinct encodings of planar graphs via canonical orderings. SIAM J. Discrete Math., 12(3):317-325, 1999.
25. X. He, M.-Y. Kao, and H.-I Lu. A fast general methodology for information-theoretically optimal encodings of graphs. SIAM J. Comput. 30(3):838-846, 2000.
26. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16:4-32, 1996. (also Proc. FOCS 92).
27. D. King and J. Rossignac. Guaranteed 3.67v bit encoding of planar triangle graphs. In Proc. CCCG, #39, 1999.
28. H.-I. Lu. Linear-time compression of bounded-genus graphs into information-theoretically optimal number of bits. In Proc. SODA, pages 223-224, 2002.
29. J. I. Munro and V. Raman. Succint representation of balanced parantheses and static trees. SIAM J. Comput., 31:762-776, 2001.
30. D. Osthus, H.J. Prömel, and A. Taraz. On random planar graphs, the number of planar graphs and their triangulations. J. Combin. Theory, Ser. B, 88(1):119-134, May 2003.
31. D. Poulalhon and G. Schaeffer. A bijection for triangulations of a polygon with interior points and multiple edges. Theoret. Comput. Sci., 307(2):385-401, 2003.
32. L. B. Richmond and N. C. Wormald. Almost all maps are asymmetric. J. Combin. Theory Ser. B, 63(1):1-7, 1995.
33. J. Rossignac. Edgebreaker: connectivity compression for triangle meshes. IEEE Trans. Visual. Comput. Graphics, 5(1):47-61, 1999.
34. G. Schaeffer. Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees. Electron. J. Combin., 4(1):# 20, 14 pp., 1997.
35. G. Schaeffer. Conjugaison d'arbres et cartes combinatoires aléatoires. Ph.D. thesis, Université Bordeaux I, 1998.
36. G. Schaeffer. Random sampling of large planar maps and convex polyhedra. In Proc. STOC, pages 760-769, 1999.
37. W. Schnyder. Embedding planar graphs on the grid. In Proc. SODA, pages 138-148, 1990.
38. C. Touma and C. Gotsman. Triangle mesh compression. In Proc. Graphics Interface, Vancouver, pages 26-34, 1998.
39. W. T. Tutte. A census of planar triangulations. Canad. J. Math., 14:21-38, 1962.
40. D. B. Wilson. Annotated bibliography of perfectly random sampling with markov chains. http://dimacs.rutgers.edu/~dbwilson/exact.