On the size of graphs that admit polyline drawings with few bends and crossing angles

Eyal Ackerman, Radoslav Fulek, Csaba D. Tóth

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

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.

Original languageEnglish
Title of host publicationGraph Drawing - 18th International Symposium, GD 2010, Revised Selected Papers
Pages1-12
Number of pages12
DOIs
StatePublished - 2011
Event18th International Symposium on Graph Drawing, GD 2010 - Konstanz, Germany
Duration: 21 Sep 201024 Sep 2010

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume6502 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Symposium on Graph Drawing, GD 2010
Country/TerritoryGermany
CityKonstanz
Period21/09/1024/09/10

Bibliographical note

Funding Information:
★ Partially supported by NSERC grant RGPIN 35586.

ASJC Scopus subject areas

  • Theoretical Computer Science
  • General Computer Science

Fingerprint

Dive into the research topics of 'On the size of graphs that admit polyline drawings with few bends and crossing angles'. Together they form a unique fingerprint.

Cite this