Transversal structures on triangulations: A combinatorial study and straight-line drawings

Discrete Mathematics

Volumn 309, Issue 7, 2009, Pages 1870-1894

  Fusy, Éric ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

Bijection; Bipolar orientations; Straight line drawing; Triangulations

Indexed keywords

HELIUM; TERMINOLOGY; TREES (MATHEMATICS);

ADDITIVE ERRORS; BIJECTION; BIPOLAR ORIENTATIONS; COMBINATORIAL STRUCTURES; COMBINATORIAL STUDIES; GRID SIZES; HIGH PROBABILITIES; PLANE GRAPHS; STRAIGHT-LINE DRAWING; TERNARY TREES; TRANSVERSAL STRUCTURES;

TRIANGULATION;

EID: 61749099418     PISSN: 0012365X     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.disc.2007.12.093     Document Type: Article

References (30)

1. Di Battista G., Tamassia R., and Tollis I.G. Area requirement and symmetry display of planar upward drawings. Discrete Comput. Geom. 7 (1992) 381-401
2. T. Biedl, F.J. Brandenburg, Drawing planar bipartite graphs with small area, in: Proceedings of CCCG, Windsor, 2005
3. Biedl T.C., Kant G., and Kaufmann M. On triangulating planar graphs under the four-connectivity constraint. Algorithmica 19 4 (1997) 427-446
4. Bonichon N., Felsner S., and Mosbah M. Convex drawings of 3-connected plane graphs. GD'04: Proceedings of the Symposium on Graph Drawing (2004), Springer-Verlag 287-299
5. Bonichon N., Gavoille C., Hanusse N., Poulalhon D., and Schaeffer G. Planar graphs, via well-orderly maps and trees. 30th International Workshop, Graph-Theoretic Concepts in Computer Science (WG). Lecture Notes in Computer Science vol. 3353 (2004), Springer-Verlag 270-284
6. E. Brehm, 3-orientations and Schnyder 3-tree-decompositions, Master's Thesis, FB Mathematik und Informatik, Freie Universität Berlin, 2000
7. W.G. Brown, Enumeration of triangulations of the disk, in: Proceedings of the London Mathematical Society, 1964, pp. 746-768
8. de Berg M., Mumford E., and Speckmann B. On rectilinear duals for vertex-weighted plane graphs. GD'05: Proceedings of the Symposium on Graph Drawing (2006), Springer-Verlag
9. de Fraysseix H., Ossona de Mendez P., and Pach J. Representation of planar graphs by segments. Intuitive Geom. 63 (1991) 109-117
10. De Fraysseix H., Ossona de Mendez P., and Rosenstiehl P. Bipolar orientations revisited. Discrete Appl. Math. 56 2-3 (1995) 157-179
11. Drmota M. Systems of functional equations. Random Structures Algorithms 10 1-2 (1997) 103-124
12. Felsner S. Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18 (2001) 19-37
13. Felsner S. Lattice structures from planar graphs. Electron. J. Combin. R15 (2004) 24p
14. P. Flajolet, R. Sedgewick, Analytic Combinatorics. Available at http://algo.inria.fr/flajolet/Publications/book051001.pdf. Preliminary version of the forthcoming book
15. Fusy E. Straight-line drawing of quadrangulations. Proceedings of Graph Drawing'06, Karlsruhe (2006), Springer 234-239
16. É. Fusy, Combinatoire des cartes planaires et applications algorithmiques, Ph.D. Thesis, École Polytechnique, 2007
17. É. Fusy, D. Poulalhon, G. Schaeffer, Dissections and trees, with applications to optimal mesh encoding and to random sampling, in: 16th Annual ACM-SIAM Symposium on Discrete Algorithms, January 2005
18. He X. On finding the rectangular duals of planar triangulated graphs. SIAM J. Comput. 22 (1993) 1218-1226
19. He X. Grid embedding of 4-connected plane graphs. Discrete Comput. Geom. (1997) 339-358
20. Kant G., and He X. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoret. Comput. Sci. 172 1-2 (1997) 175-193
21. Khuller S., Naor J., and Klein P.N. The lattice structure of flow in planar graphs. SIAM J. Discrete Math. 6 3 (1993) 477-490
22. Miura K., Nakano S., and Nishizeki T. Grid drawings of four-connected plane graphs. Discrete Comput. Geom. 26 2 (2001) 73-87
23. P. Ossona de Mendez, Orientations bipolaires, Ph.D. Thesis, Paris, 1994
24. D. Poulalhon, G. Schaeffer, Optimal coding and sampling of triangulations, in: Automata, Languages and Programming. 30th International Colloquium, ICALP 2003, vol. 2719, Eindhoven, 2003, pp. 1080-1094
25. G. Schaeffer, Conjugaison d'arbres et cartes combinatoires aléatoires, Ph.D. Thesis, Université Bordeaux I, 1998
26. Schaeffer G. Random sampling of large planar maps and convex polyhedra. Annual ACM Symposium on Theory of Computing (Atlanta, GA, 1999) (1999), ACM, New York 760-769 (electronic)
27. Schnyder W. Planar graphs and poset dimension. Order 5 (1989) 323-343
28. W. Schnyder, Embedding planar graphs on the grid, in: SODA'90: Proceedings of the First Annual ACM-SIAM Symposium on Discrete Algorithms, 1990, pp. 138-148
29. B. Speckmann, M. Van Kreveld, On rectangular cartograms, Technical report, 2004
30. Tutte W.T. A census of planar triangulations. Canad. J. Math. 14 (1962) 21-38