Graphs that admit polyline drawings with few crossing angles

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

doi:10.1137/100819564

Graphs that admit polyline drawings with few crossing angles

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

Faculty of Natural Sciences

Research output: Contribution to journal › Article › peer-review

Abstract

We consider graphs that admit polyline drawings where all crossings occur at the same angle a ε (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 language	English
Pages (from-to)	305-320
Number of pages	16
Journal	SIAM Journal on Discrete Mathematics
Volume	26
Issue number	1
DOIs	https://doi.org/10.1137/100819564
State	Published - 2012

Keywords

Crossing number
Geometric graph
Polyline drawing

ASJC Scopus subject areas

General Mathematics

Access to Document

10.1137/100819564

Cite this

@article{6641aac12e044ccc85a8f4eb9970b364,

title = "Graphs that admit polyline drawings with few crossing angles",

abstract = "We consider graphs that admit polyline drawings where all crossings occur at the same angle a ε (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.",

keywords = "Crossing number, Geometric graph, Polyline drawing",

author = "Eyal Ackerman and Radoslav Fulek and T{\'o}th, \{Csaba D.\}",

year = "2012",

doi = "10.1137/100819564",

language = "English",

volume = "26",

pages = "305--320",

journal = "SIAM Journal on Discrete Mathematics",

issn = "0895-4801",

publisher = "Society for Industrial and Applied Mathematics Publications",

number = "1",

}

TY - JOUR

T1 - Graphs that admit polyline drawings with few crossing angles

AU - Ackerman, Eyal

AU - Fulek, Radoslav

AU - Tóth, Csaba D.

PY - 2012

Y1 - 2012

N2 - We consider graphs that admit polyline drawings where all crossings occur at the same angle a ε (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.

AB - We consider graphs that admit polyline drawings where all crossings occur at the same angle a ε (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.

KW - Crossing number

KW - Geometric graph

KW - Polyline drawing

UR - https://www.scopus.com/pages/publications/84861595475

U2 - 10.1137/100819564

DO - 10.1137/100819564

M3 - Article

AN - SCOPUS:84861595475

SN - 0895-4801

VL - 26

SP - 305

EP - 320

JO - SIAM Journal on Discrete Mathematics

JF - SIAM Journal on Discrete Mathematics

IS - 1

ER -

Graphs that admit polyline drawings with few crossing angles

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this