We consider graphs that admit polyline drawings where all crossings occur at the same angle α ∈ (0, π/2). We prove that every graph on n vertices that admits such a polyline drawing with at most two bends per edge has O(n) edges. This result remains true when each crossing occurs at an angle from a small set of angles. We also provide several extensions that might be of independent interest. © 2011 Springer-Verlag.
CITATION STYLE
Ackerman, E., Fulek, R., & Tóth, C. D. (2011). On the size of graphs that admit polyline drawings with few bends and crossing angles. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6502 LNCS, pp. 1–12). https://doi.org/10.1007/978-3-642-18469-7_1
Mendeley helps you to discover research relevant for your work.