Straight-line drawing of quadrangulations

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

Volumn 4372 LNCS, Issue , 2007, Pages 234-239

  Fusy, Éric ^a  

^a ÉCOLE POLYTECHNIQUE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION; PARAMETER ESTIMATION;

COMBINATORIAL PARAMETER; FACE-COUNTING ALGORITHMS; STRAIGHT-LINE DRAWING;

GRAPH THEORY;

EID: 38149004992     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70904-6_23     Document Type: Conference Paper

References (11)

1. Therese Biedl and Franz J. Brandenburg. Drawing planar bipartite graphs with small area. In Proceedings of CCCG, Windsor, pages 105-108, 2005.
2. N. Bonichon, S. Felsner, and M. Mosbah. Convex drawings of 3-connected plane graphs. In Proceedings of Graph Drawing, pages 287-299. Springer-Verlag, 2004.
3. H. de Fraysseix, P. Ossona de Mendez, and J. Pach. A left-first search algorithm for planar graphs. Discrete Comput. Geom., 13:459-468, 1995.
4. H. de Fraysseix, P. Ossona de Mendez, and P. Rosenstiehl. Bipolar orientations revisited. Discrete Appl. Math., 56(2-3):157-179, 1995.
5. H. de Fraysseix, J. Pach, and R. Pollack. How to draw a planar graph on a grid. Combinatorica, 10(1):41-51, 1990.
6. E. Fusy. Transversal structures on triangulations, with application to straight-line drawing. In Proceedings of Graph Drawing, LNCS 3843, pages pp. 177-188, 2005. Full paper with proofs available at http://arxiv.org/abs/ math.CO~/0602163.
7. C. Huemer and S. Kappes. A binary labelling for plane laman graphs and quadrangulations. In Proceedings of EWCG, Delphi, pages 83-86, 2006.
8. G. Kant. Drawing planar graphs using the canonical ordering. Algorithmica, 16(1):4-32, 1996.
9. 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.
10. K. Miura, S. Nakano, and T. Nishizeki. Grid drawings of four-connected plane graphs. Disc. Comput. Geometry, 26(2):73-87, 2001.
11. W. Schnyder. Embedding planar graphs on the grid. In Proceedings of the first annual ACM-SIAM Symposium on Discrete Algorithms, pages 138-148, 1990.