Anzeige
Erschienen in:
2011 | OriginalPaper | Buchkapitel
On the Size of Graphs That Admit Polyline Drawings with Few Bends and Crossing Angles
verfasst von : Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth
Erschienen in: Graph Drawing
Verlag: Springer Berlin Heidelberg
Aktivieren Sie unsere intelligente Suche, um passende Fachinhalte oder Patente zu finden.
Wählen Sie Textabschnitte aus um mit Künstlicher Intelligenz passenden Patente zu finden. powered by
Markieren Sie Textabschnitte, um KI-gestützt weitere passende Inhalte zu finden. 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.