Graphs That Admit Polyline Drawings with Few Crossing Angles

We consider graphs that admit polyline drawings where all crossings occur at the same angle alpha is an element of (0, pi/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.


Published in:
SIAM Journal on Discrete Mathematics, 26, 1, 305
Year:
2012
ISSN:
0895-4801
Keywords:
Laboratories:




 Record created 2012-04-17, last modified 2018-09-13


Rate this document:

Rate this document:
1
2
3
 
(Not yet reviewed)