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

ACM Transactions on Algorithms

Volumn 4, Issue 2, 2008, Pages

  Fusy, Éric ^a   Schaeffer, Gilles ^a   Poulalhon, Dominique ^b  

^a ÉCOLE POLYTECHNIQUE   (France)

^b UNIVERSITÉ PARIS DIDEROT   (France)

Author keywords

Bijection; Coding; Counting; Random generation

Indexed keywords

BINARY TREES; CLUSTERING ALGORITHMS; DISSECTION; ENCODING (SYMBOLS); GRAPHIC METHODS; MESH GENERATION; SIGNAL ENCODING;

3-CONNECTED PLANAR GRAPHS; BIJECTIONS; CODING; COUNTING; LINEAR-TIME ALGORITHMS; OPTIMAL MESH ENCODING; RANDOM GENERATION; STRAIGHT-LINE DRAWINGS;

GRAPH THEORY;

EID: 44849124764     PISSN: 15496325     EISSN: 15496333     Source Type: Journal    
DOI: 10.1145/1361192.1361196     Document Type: Article

References (45)

1. 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.
2. A MBJØ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.
3. DI BATTISTA, G., TAMASSIA, R., AND VISMARA, L. 1999. Output-sensitive reporting of disjoint paths. Algorithmica 23, 3, 302-340.
4. BENDER, E. A. 1987. The number of three-dimensional convex polyhedra. Amer. Math. Month. 94, 1, 7-21.
5. 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.
6. BONICHON, N., FELSNER, S., AND MOSBAH, M. 2007. Convex drawings of 3-connected planar graphs. Algorithmica 47, 4, 399-420.
7. 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.
8. 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.
9. 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.
10. BROWN, W. 1964. Enumeration of triangulations of the disk. In Proceedings of the London Mathematical Society. 746-768.
11. CASTELLI-ALEARDI, L. AND DEVILLERS, O. 2004. Canonical triangulation of a graph, with a coding application. http://www.inria.fr/rrrt/rr-5231.html.
12. 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.
13. 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.
14. DENISE, A., VASCONCELLOS, M., AND WELSH, D. J. A. 1996. The random planar graph. Congr. Numer. 113, 61-79.
15. 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.
16. FELSNER, S. 2001. Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18, 19-37.
17. FELSNER, S. 2004. Lattice structures for planar graphs. Electron. J. Comb. 11, 1.
18. FLAJOLET, P., ZIMMERMANN, P., AND VAN CUTSEM, B. 1994. A calculus for random generation of combinatorial structures. Theoret. Comput. Sci. 132, 2, 1-35.
19. DE FRAYSSEIX, H., OSSONA DE MENDEZ, P., AND ROSENSTIEHL, P. Pigale, Automatic Graph Drawing. http://sourceforge.org/pigale/.
20. FUSY, É. 2005. Quadratic exact size and linear approximate size random generation of planar graphs. Discr. Math. Theor. Comput. Sci. AD, 125-138.
21. GESSEL, I. 1992. Super ballot numbers. J. Symb. Comput. 14, 2/3, 179-194.
22. GOTSMAN, C. 2003. On the optimality of valence-based connectivity coding. Comput. Graph. Foru., 99-102.
23. 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.
24. 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.
25. KANT, G. 1996. Drawing planar graphs using the canonical ordering. Algorithmica 16, 4-32. (also FOCS'92).
26. KHODAKOVSKY, A., ALLIEZ, P., DESBRUN, M., AND SCHRÖDER, P. 2002. Near-optimal connectivity encoding of polygon meshes. Graph. Model 64, 3-4.
27. 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.
28. LU, H.-I. 2002. Linear-time compressionofbounded-genusgraphs into information-theoretically optimal number of bits. In Proceedings of Symposium on Discrete Algorithms (SODA'02), San Francisco, CA. ACM Press, 223-224.
29. MCDIARMID, C., STEGER, A., AND WELSH, D. 2005. Random planar graphs. J. Combin. Theory, Series B 93, 187-205.
30. MULLIN, R. AND SCHELLENBERG, P. 1968. The enumeration of c-nets via quadrangulations. J. Combin. Theory 4, 259-276.
31. 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.
32. NIJENHUIS, A. AND WILF, H. S. 1978. Combinatorial Algorithms, 2nd Ed. Academic Press.
33. OSSONA DE MENDEZ, P. 1994. Orientations bipolaires. Ph.D. thesis, Ecole des Hautes Etudes en Sciences Sociales, Paris, France.
34. 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.
35. POULALHON, D. AND SCHAEFFER, G. 2006. Optimal coding and sampling of triangulations. Algorithmica 46(3-4), 505-527.
36. ROSSIGNAC, J. 1999. Edgebreaker: Connectivity compression for triangle meshes. IEEE Trans. Visualiz. Comput. Graph. 5, 1, 47-61.
37. SCHAEFFER, G. 1997. Bijective census and random generation of Eulerian planar maps with prescribed vertex degrees. Electron. J. Combin. 4, 1, # 20, 14 pp.
38. 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.
39. 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.
40. TOUMA, C. AND GOTSMAN, C. 1998. Triangle mesh compression. In Graphic Interface Conference 26-34.
41. TUTTE, W. T. 1962. A census of planar triangulations. Canad. J. Math. 14, 21-38.
42. TUTTE, W. T. 1963. A census of planar maps. Canad. J. Math. 15, 249-271.
43. WHITNEY, H. 1933. 2-isomorphic graphs. Amer. J. Math. 54, 245-254.
44. 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.
45. WILSON, D. B. 2004. An annotated bibliography of perfectly random sampling with markov chains. http://dimacs.rutgers.edu/∼dbwilson/ exact.