Abstract
We study methods to manipulate weights in stress-graph embeddings to improve convex straight-line planar drawings of 3-connected planar graphs. Stress-graph embeddings are weighted versions of Tutte embeddings, where solving a linear system places vertices at a minimum-energy configuration for a system of springs. A major drawback of the unweighted Tutte embedding is that it often results in drawings with exponential area. We present a number of approaches for choosing better weights. One approach constructs weights (in linear time) that uniformly spread all vertices in a chosen direction, such as parallel to the x- or y-axis. A second approach morphs x- and y-spread drawings to produce a more aesthetically pleasing and uncluttered drawing. We further explore a “kaleidoscope” paradigm for this xy-morph approach, where we rotate the coordinate axes so as to find the best spreads and morphs. A third approach chooses the weight of each edge according to its depth in a spanning tree rooted at the outer vertices, such as a Schnyder wood or BFS tree, in order to pull vertices closer to the boundary.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Notes
- 1.
Proofs of Fáry’s Theorem, that any simple, planar graph can be embedded in the plane without crossings so each edge is drawn as a straight line segment, came earlier [7, 15, 17], but these proofs do not give specific coordinates for the vertices; hence, it is not clear they can be called “graph drawing algorithms.”.
- 2.
Tutte’s approach can be viewed as being for the case when \(w_{u,v}=1\) for each edge.
- 3.
However, their proof is only valid for polyhedra that have a triangle face.
References
Bonichon, N., Felsner, S., Mosbah, M.: Convex drawings of 3-connected plane graphs. Algorithmica 47(4), 399–420 (2007)
Chimani, M., Gutwenger, C., Jünger, M., Klau, G., Klein, K., Mutzel, P.: The open graph drawing framework (OGDF). In: Handbook of Graph Drawing and Visualization, pp. 543–569. CRC Press (2013)
Chrobak, M., Goodrich, M.T., Tamassia, R.: Convex drawings of graphs in two and three dimensions. In: 12th Symposium on Computational Geometry (SoCG), pp. 319–328. New York, NY, USA (1996). https://doi.org/10.1145/237218.237401
Di Battista, G., Eades, P., Tamassia, R., Tollis, I.G.: Graph Drawing: Algorithms for the Visualization of Graphs. Prentice Hall, Hoboken (1999)
Eades, P., Garvan, P.: Drawing stressed planar graphs in three dimensions. In: Brandenburg, F.J. (ed.) GD 1995. LNCS, vol. 1027, pp. 212–223. Springer, Heidelberg (1996). https://doi.org/10.1007/BFb0021805
Erickson, J., Lin, P.: Planar and toroidal morphs made easier. In: Purchase, H.C., Rutter, I. (eds.) GD 2021. LNCS, vol. 12868, pp. 123–137. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-92931-2_9
Fáry, I.: On straight-line representation of planar graphs. Acta Scientiarum Mathematicarum 11(2), 229–233 (1948)
Felsner, S.: Lattice structures from planar graphs. The Electronic Journal of Combinatorics, pp. R15–R15 (2004)
Floater, M.S.: Parametric tilings and scattered data approximation. Int. J. Shape Model. 04(03n04), 165–182 (1998). https://doi.org/10.1142/S021865439800012X
Floater, M.S., Gotsman, C.: How to morph tilings injectively. J. Comput. Appl. Math. 101(1), 117–129 (1999). https://doi.org/10.1016/S0377-0427(98)00202-7, https://www.sciencedirect.com/science/article/pii/S0377042798002027
Hopcroft, J.E., Kahn, P.J.: A paradigm for robust geometric algorithms. Algorithmica 7(1–6), 339–380 (1992)
Kleist, L., Klemz, B., Lubiw, A., Schlipf, L., Staals, F., Strash, D.: Convexity-increasing morphs of planar graphs. Comput. Geom. 84, 69–88 (2019)
Kobourov, S.G.: Spring embedders and force directed graph drawing algorithms. arXiv preprint arXiv:1201.3011 (2012)
Schnyder, W.: Embedding planar graphs on the grid. In: 1st ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 138–148 (1990)
Stein, S.K.: Convex maps. Proc. Am. Math. Soc. 2(3), 464–466 (1951)
Tutte, W.T.: How to draw a graph. Proc. Lond. Math. Soc. 3(1), 743–767 (1963)
Wagner, K.: Bemerkungen zum Vierfarbenproblem. Jahresber. Deutsch. Math.-Verein. 46, 26–32 (1936)
Acknowledgements
This research was supported in part by NSF grant CCF-2212129.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2023 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Chiu, A., Eppstein, D., Goodrich, M.T. (2023). Manipulating Weights to Improve Stress-Graph Drawings of 3-Connected Planar Graphs. In: Bekos, M.A., Chimani, M. (eds) Graph Drawing and Network Visualization. GD 2023. Lecture Notes in Computer Science, vol 14466. Springer, Cham. https://doi.org/10.1007/978-3-031-49275-4_10
Download citation
DOI: https://doi.org/10.1007/978-3-031-49275-4_10
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-49274-7
Online ISBN: 978-3-031-49275-4
eBook Packages: Computer ScienceComputer Science (R0)