Advertisement
Published in:
2011 | OriginalPaper | Chapter
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles
Authors : Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth
Published in: Graph Drawing
Publisher: Springer Berlin Heidelberg
Activate our intelligent search to find suitable subject content or patents.
Select sections of text to find matching patents with Artificial Intelligence. powered by
Select sections of text to find additional relevant content using AI-assisted search. powered by
We consider graphs that admit polyline drawings where all crossings occur at the same angle
$\alpha\in (0,\frac{\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.