Free Edge Lengths in Plane Graphs
- 146 Downloads
We study the impact of metric constraints on the realizability of planar graphs. Let G be a subgraph of a planar graph H (where H is the “host” of G). The graph G is free in H if for every choice of positive lengths for the edges of G, the host H has a planar straight-line embedding that realizes these lengths; and G is extrinsically free in H if all constraints on the edge lengths of G depend on G only, irrespective of additional edges of the host H. We characterize the planar graphs G that are free in every host H, \(G\subseteq H\), and all the planar graphs G that are extrinsically free in every host H, \(G\subseteq H\). The case of cycles \(G=C_k\) provides a new version of the celebrated carpenter’s rule problem. Even though cycles \(C_k\), \(k\ge 4\), are not extrinsically free in all triangulations, it turns out that “nondegenerate” edge lengths are always realizable, where the edge lengths are considered degenerate if the cycle can be flattened (into a line) in two different ways. Separating triangles, and separating cycles in general, play an important role in our arguments. We show that every star is free in a 4-connected triangulation (which has no separating triangle).
KeywordsGeometric graph Graph embedding Bar-and-joint framework
The work on this problem started at the 10th Gremo Workshop on Open Problems (Bergün, GR, Switzerland) and continued at the MIT-Tufts Research Group on Computational Geometry. We thank all participants of these meetings for stimulating discussions.
- 1.Angelini, P., Da Lozzo, G., Di Battista, G., Frati, F., Patrignani, M., Roselli, V.: Morphing planar graph drawings optimally. In: Proceedings of the 41st International Colloquium on Automata, Languages, and Programming (ICALP), Part I. Lecture Notes in Computer Science 8572, pp. 126–137. Springer, New York (2014)Google Scholar
- 2.Angelini, P., Di Battista, G., Frati, F., Jelínek, V., Kratochvíl, J., Patrignani, M., Rutter, I.: Testing planarity of partially embedded graphs. ACM Transactions on Algorithms 11(4), Art No. 32 (2015)Google Scholar
- 10.Frati, F., Patrignani, M.: A note on minimum-area straight-line drawings of planar graphs. In: 15th Graph Drawing. Lecture Notes in Computer Science 4875, pp. 339–344. Springer, New York (2008)Google Scholar
- 14.Kurowski, M.: Planar straight-line drawing in an \(O(n)\times O(n)\) grid with angular resolution \(\Omega (1/n)\). In: Proceedings of the 31st Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM). Lecture Notes in Computer Science 3381, pp. 250–258. Springer, New York (2005)Google Scholar
- 18.Sauer, N.W.: Edge labelled graphs and metric spaces. In: Abstracts of the Erdős Centennial, p. 78. Budapest (2013)Google Scholar
- 19.Schnyder, W.: Embedding planar graphs in the grid. In: Proceedings of the 1st ACM-SIAM Symposium on Discrete Algorithms, pp. 138–147. ACM, San Francisco (1990)Google Scholar