Abstract
In this paper we study connections between planar graphs, Schnyder woods, and orthogonal surfaces. Schnyder woods and the face counting approach have important applications in graph drawing and the dimension theory of orders. Orthogonal surfaces explain connections between these seemingly unrelated notions. We use these connections for an intuitive proof of the Brightwell-Trotter Theorem which says, that the face lattice of a 3-polytope minus one face has order dimension three. Our proof yields a linear time algorithm for the construction of the three linear orders that realize the face lattice.
Coplanar orthogonal surfaces are in correspondence with a large class of convex straight line drawings of 3-connected planar graphs. We show that Schnyder’s face counting approach with weighted faces can be used to construct all coplanar orthogonal surfaces and hence the corresponding drawings. Appropriate weights are computable in linear time.
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
References
Badent, M., Binucci, C., Giacomo, E.D., Didimo, W., Felsner, S., Giordano, F., Kratochvil, J., Palladino, P., Patrignani, M., Trotta, F.: Homothetic triangle contact representations of planar graphs. Presented at 19th Cana. Conf. on Comp. Geom., 2007
Bárány, I., Rote, G.: Strictly convex drawings of planar graphs. Doc. Math. 11, 369–391 (2006)
Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected planar graphs. Algorithmica 47, 399–420 (2007)
Brightwell, G., Trotter, W.T.: The order dimension of convex polytopes. SIAM J. Discrete Math. 6, 230–245 (1993)
Brightwell, G., Trotter, W.T.: The order dimension of planar maps. SIAM J. Discrete Math. 10, 515–528 (1997)
Chiang, Y., Lin, C., Lu, H.: Orderly spanning trees with applications to graph encoding and graph drawing. SIAM J. Comput. 34, 924–945 (2005)
Chuang, R., Garg, A., He, X., Kao, M., Lu, H.: Compact encodings of planar graphs via canonical orderings and multiple parentheses. In: Proc. 25th Int. Col. on Autom., Lang., and Prog., pp. 118–129, 1998
Felsner, S.: http://www.math.tu-berlin.de/~felsner/Schnyder.bib
Felsner, S.: Convex drawings of planar graphs and the order dimension of 3-polytopes. Order 18, 19–37 (2001)
Felsner, S.: Geodesic embeddings and planar graphs. Order 20, 135–150 (2003)
Felsner, S.: Geometric Graphs and Arrangements. Vieweg, Wiesbaden (2004)
Felsner, S., Kappes, S.: Orthogonal surfaces. arXiv: math.CO/0602063 (2006, submitted)
Fusy, E., Poulalhon, D., Schaeffer, G.: Dissection and trees, with applications to optimal mesh encoding and random sampling. In: Proc. 16. ACM-SIAM Sympos. Discrete Algorithms, pp. 690–699 (2005)
Kant, G.: Drawing planar graphs using the canonical ordering. Algorithmica 16, 4–32 (1996)
Lin, C., Lu, H., Sun, I.-F.: Improved compact visibility representation of planar graphs via Schnyder’s realizer. SIAM J. Discrete Math. 18, 19–29 (2004)
Miller, E.: Planar graphs as minimal resolutions of trivariate monomial ideals. Doc. Math. 7, 43–90 (2002)
Schnyder, W.: Planar graphs and poset dimension. Order 5, 323–343 (1989)
Schnyder, W.: Embedding planar graphs on the grid. In: Proc. 1st ACM-SIAM Sympos. Discrete Algorithms, pp. 138–148, 1990
Trotter, W.T.: Combinatorics and Partially Ordered Sets: Dimension Theory. Johns Hopkins University Press, Baltimore (1992)
Trotter, W.T.: Partially ordered sets. In: Graham, Grötschel, Lovász (eds.) Handbook of Combinatorics, vol. I, pp. 433–480 (1995)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Felsner, S., Zickfeld, F. Schnyder Woods and Orthogonal Surfaces. Discrete Comput Geom 40, 103–126 (2008). https://doi.org/10.1007/s00454-007-9027-9
Received:
Revised:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-007-9027-9