Schnyder woods and orthogonal surfaces

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

Volumn 4372 LNCS, Issue , 2007, Pages 417-429

  Felsner, Stefan ^a   Zickfeld, Florian ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; NUMERICAL METHODS; THEOREM PROVING;

COPLANAR ORTHOGONAL SURFACES; POLYTOPE MINUS;

GRAPH THEORY;

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

References (17)

1. I. BÁRÁNY AND G. ROTE, Strictly convex drawings of planar graphs, 2005. arXiv:cs.CG/0507030.
2. N. BONICHON, S. FELSNER, AND M. MOSBAH, Convex drawings of 3-connected planar graphs, in Graph Drawing (Proc. GD '04), vol. 3383 of Lecture Notes in Comput. Sci., 2004, pp. 60-70.
3. G. BRIGHTWELL AND W. T. TROTTER, The order dimension of convex polytopes, SIAM J. Discrete Math., 6 (1993), pp. 230-245.
4. G. BRIGHTWELL AND W. T. TROTTER, The order dimension of planar maps, SIAM J. Discrete Math., 10 (1997), pp. 515-528.
5. G. DI BATTISTA, R. TAMASSIA, AND L. VISMARA, Output-sensitive reporting of disjoint paths, Algorithmica, 23 (1999), pp. 302-340.
6. S. FELSNER. http://www.math.tu-berlin.de/~felsner/Schnyder.bib.
7. S. FELSNER, Convex drawings of planar graphs and the order dimension of 3-polytopes, Order, 18 (2001), pp. 19-37.
8. S. FELSNER, Geodesic embeddings and planar graphs, Order, 20 (2003), pp. 135-150.
9. S. FELSNER, Geometric Graphs and Arrangements, Vieweg Verlag, 2004.
10. S. FELSNER AND F. ZICKFELD, Schnyder woods and orthogonal surfaces, 2006. http://www.math.tu-berlin.de/~felsner/swaos.pdf.
11. E. FUSY, D. POULALHON, AND G.SCHAEFFER, Dissection and trees, with applications to optimal mesh encoding and random sampling, in Proc. 16. ACM-SIAM Sympos. Discrete Algorithms, 2005, pp. 690-699.
12. G. KANT, Drawing planar graphs using the Imc-ordering, in Proc. 33rd IEEE Sympos. on Found, of Comp. Sci., 1992, pp. 101-110.
13. C. LIN, H. LU, AND I.-F. SUN, Improved compact visibility representation of planar graphs via Schnyder's realizer, SIAM J. Discrete Math., 18 (2004), pp. 19-29.
14. E. MILLER, Planar graphs as minimal resolutions of trivariate monomial ideals, Documenta Math., 7 (2002), pp. 43-90.
15. W. SCHNYDER, Planar graphs and poset dimension, Order, 5 (1989), pp. 323-343.
16. W. SCHNYDER, Embedding planar graphs on the grid, in Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, 1990, pp. 138-148.
17. W. T. TROTTER, Combinatorics and Partially Ordered Sets: Dimension Theory, The Johns Hopkins University Press, 1992.