A census of graph-drawing algorithms based on generalized transversal structures (2403.18980v3)
Abstract: We present two graph drawing algorithms based on the recently defined "grand-Schnyder woods", which are a far-reaching generalization of the classical Schnyder woods. The first is a straight-line drawing algorithm for plane graphs with faces of degree 3 and 4 with no separating 3-cycle, while the second is a rectangular drawing algorithm for the dual of such plane graphs. In our algorithms, the coordinates of the vertices are defined in a global manner, based on the underlying grand-Schnyder woods. The grand-Schnyder woods and drawings are computed in linear time. When specializing our algorithms to special classes of plane graphs, we recover the following known algorithms: (1) He's algorithm for rectangular drawing of 3-valent plane graphs, based on transversal structures, (2) Fusy's algorithm for the straight-line drawing of triangulations of the square, based on transversal structures, (3) Bernardi and Fusy's algorithm for the orthogonal drawing of 4-valent plane graphs, based on 2-orientations, (4) Barriere and Huemer's algorithm for the straight-line drawing of quadrangulations, based on separating decompositions. Our contributions therefore provide a unifying perspective on a large family of graph drawing algorithms that were originally defined on different classes of plane graphs and were based on seemingly different combinatorial structures.
- O. Bernardi and É. Fusy. Schnyder decompositions for regular plane graphs and application to drawing. Algorithmica, 62(3):1159–1197, 2012.
- Grand Schnyder woods. ArXiv preprint arXiv.2303.15630, 2023.
- L. Barriere and C. Huemer. 4-labelings and grid embeddings of plane quadrangulations. Discrete Mathematics, 312(10):1722–1731, 2012.
- On triangulating planar graphs under the four-connectivity constraint. Algorithmica, 19:427–446, 1997.
- Bipolar orientations revisited. Discrete Applied Mathematics, 56(2-3):157–179, 1995.
- É. Colin de Verdière. Shortening of curves and decomposition of surfaces. PhD thesis, Université Paris 7, 2003.
- Binary Labelings for Plane Quadrangulations and their Relatives. Discrete Mathematics & Theoretical Computer Science, Vol. 12 no. 3, January 2011.
- Bend-optimal orthogonal graph drawing in the general position model. Comput. Geom., 47(3):460–468, 2014.
- É. Fusy. Straight-line drawing of quadrangulations. In Graph Drawing: 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers 14, pages 234–239. Springer, 2007.
- É. Fusy. Transversal structures on triangulations: A combinatorial study and straight-line drawings. Discrete Math., 309:1870–1894, 2009.
- Minimum cost flows in graphs with unit capacities. In 32nd International Symposium on Theoretical Aspects of Computer Science (STACS 2015). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik, 2015.
- X. He. On finding the rectangular duals of planar triangulated graphs. SIAM Journal on Computing, 22:1218–1226, 1993.
- W. Schnyder. Planar graphs and poset dimension. Order, 5(4):323–343, 1989.
- W. Schnyder. Embedding planar graphs in the grid. Symposium on Discrete Algorithms (SODA), pages 138–148, 1990.
- R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM Journal on Computing, 16(3):421–444, 1987.