Transversal structures on triangulations, with application to straight-line drawing

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3843 LNCS, Issue , 2006, Pages 177-188

  Fusy, Éric ^a  

^a INRIA ROCQUENCOURT   (France)

Author keywords

[No Author keywords available]

Indexed keywords

BORDER VERTICES; STRAIGHT-LINE DRAWING ALGORITHMS; TRANSVERSAL EDGE-PARTITION;

ALGORITHMS; DRAWING (GRAPHICS); NUMERICAL ANALYSIS; RANDOM PROCESSES; TREES (MATHEMATICS);

GRAPH THEORY;

EID: 33745671115     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11618058_17     Document Type: Conference Paper

References (17)

1. Therese C. Biedl, Goos Kant, and Michael Kaufmann. On triangulating planar graphs under the four-connectivity constraint. Algorithmica, 19(4):427-446, 1997.
2. N. Bonichon, S. Felsner, and M. Mosbah. Convex drawings of 3-connected plane graphs. In GD '04: Proceedings of the Symposium on Graph Drawing, pages 287-299. Springer-Verlag, 2004.
3. th International Workshop, Graph - Theoretic Concepts in Computer Science (WG), volume 3353 of Lecture Notes in Computer Science, pages 270-284. Springer-Verlag, 2004.
4. H. de Fraysseix, P. Ossona de Mendez, and J. Pach. Representation of planar graphs by segments. Intuitive Geometry, 63:109-117, 1991.
5. H. de Fraysseix, P. Ossona de Mendez, and P. Rosenstiehl. Bipolar orientations revisited. Discrete Appl. Math., 56(2-3):157-179, 1995.
6. P. O. de Mendez. Orientations bipolaires. PhD thesis, Paris, 1994.
7. Stefan Felsner. Lattice structures from planar graphs. Electronic Journal of Combinatorics, (R15):24p., 2004,
8. É. Fusy, D. Poulalhon, and 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.
9. X. He. Grid embedding of 4-connected plane graphs. In GD '95: Proceedings of the Symposium on Graph Drawing, pages 287-299. Springer-Verlag, 1996.
10. G. Kant and Xin He. Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems. Theoretical Computer Science, 172(1-2):175-193, 1997.
11. K. Miura, S. Nakano, and T. Nishizeki, Grid drawings of four-connected plane graphs. Disc. Comput. Geometry, 26(2):73-87, 2001.
12. D. Poulalhon and G. Schaeffer. Optimal coding and sampling of triangulations. In Automata, Languages and Programming. 30th International Colloquium, ICALP 2003, Eindhoven, The Netherlands, June 30 - July 4, 2003. Proceedings, volume 2719 of Lecture Notes in Computer Science, pages 1080-1094. Springer-Verlag, 2003.
13. G. Schaeffer. Conjugaison d'arbres et cartes combinatoires aléatoires. PhD thesis, Université Bordeaux I, 1998.
14. G. Schaeffer. Random sampling of large planar maps and convex polyhedra. In Annual ACM Symposium on Theory of Computing (Atlanta, GA, 1999), pages 760-769 (electronic). ACM, New York, 1999.
15. W. Schnyder. Planar graphs and poset dimension. Order, 5:323-343, 1989.
16. W. Schnyder. Embedding planar graphs on the grid. In SODA '90: Proceedings of the first annual ACM-SIAM symposium on Discrete algorithms, pages 138-148, 1990.
17. W. T. Tutte. A census of planar triangulation. Canad. J. Math., 14:21-38, 1962.