Loading...
research article
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.
Type
research article
Web of Science ID
WOS:000302182600021
Authors
Publication date
2012
Published in
Volume
26
Issue
1
Start page
305
Peer reviewed
REVIEWED
EPFL units
Available on Infoscience
April 17, 2012
Use this identifier to reference this record