4-Labelings and Grid Embeddings of Plane Quadrangulations
Finding aesthetic drawings of planar graphs is a main issue in graph drawing. Of special interest are rectangle of influence drawings.The graphs considered here are quadrangulations, that is, planar graphs all whose faces have degree four.We show that each quadrangulation on n vertices has a closed rectangle of influence drawing on the (n - 2) × (n - 2) grid. Biedl, Bretscher and Meijer  proved that every planar graph on n vertices without separating triangle has a closed rectangle of influence drawing on the (n - 1) × (n - 1) grid.Our method, which is completely different from that of , is in analogy to Schnyder’s algorithm for embedding triangulations on an integer grid  and gives a simple algorithm.
KeywordsPlanar Graph Computational Geometry Interior Vertex Graph Drawing Planar Bipartite Graph
- 1.Biedl, T., Brandenburg, F.: Drawing planar bipartite graphs with small area. In: Proceedings of the 17th Canadian Conference on Computational Geometry, Windsor, Canada, pp. 105–108 (2005)Google Scholar
- 4.Felsner, S., Fusy, E., Noy, M., Orden, D.: Bijections for Baxter Families and Related Objects (2008), http://arxiv.org/abs/0803.1546
- 5.Felsner, S., Huemer, C., Kappes, S., Orden, D.: Binary Labelings for Plane Quadrangulations and their Relatives (2008), http://arxiv.org/abs/math/0612021v3
- 8.Huemer, C., Kappes, S.: A binary labelling for plane Laman graphs and quadrangulations. In: Proceedings of the 22nd European Workshop on Computational Geometry, Delphi, Greece, pp. 83–86 (2006)Google Scholar
- 9.Schnyder, W.: Embedding Planar Graphs on the Grid. In: Proceedings of the first annual ACM-SIAM Symposium on Discrete Algorithms, pp. 138–148 (1990)Google Scholar