Crossing Angles of Geometric Graphs
We study the crossing angles of geometric graphs in the plane. We introduce the crossing angle number of a graph G, denoted can(G), which is the minimum number of angles between crossing edges in a straight line drawing of G. We show that an n-vertex graph G with can(G) = O(1) has O(n) edges, but there are graphs G with bounded degree and arbitrarily large can(G). We also initiate studying the global crossing-angle rigidity of geometric graphs. We construct bounded degree graphs G = (V,E) such that for any two straight-line drawings of G with the same prescribed crossing angles, there is a subset V′ ⊂ V of |V′| ≥ |V|/2 vertices that are similar in the two drawings.
KeywordsComplete Graph Supporting Line Geometric Graph Free Vertex Geometric Thickness
Unable to display preview. Download preview PDF.
- 3.Barát, J., Matoušek, J., Wood, D.R.: Bounded-degree graphs have arbitrarily large geometric thickness. Electr. J. Comb. 13(1) (2006)Google Scholar
- 9.Dillencourt, M.B., Eppstein, D., Hirschberg, D.S.: Geometric thickness of complete graphs. J. Graph Alg. & Appl. 4(3), 5–17Google Scholar
- 10.Dujmović, V., Gudmundsson, J., Morin, P., Wolle, T.: Notes on large angle crossing graphs. Chicago J. Theor. Comput. Sci (2011)Google Scholar
- 17.Pach, J., Pálvölgyi, D.: Bounded-degree graphs can have arbitrarily large slope numbers. Electr. J. Comb. 13(1) (2006)Google Scholar
- 19.Saxe, J.B.: Embeddability of weighted graphs in k-space is strongly NP-hard. In: 17th Allerton Conf. in Communications, Control and Computing, pp. 480–489 (1979)Google Scholar