Extending Drawings of Graphs to Arrangements of Pseudolines - Archive ouverte HAL Access content directly
Conference Papers Year : 2020

Extending Drawings of Graphs to Arrangements of Pseudolines

Abstract

In the recent study of crossing numbers, drawings of graphs that can be extended to an arrangement of pseudolines (pseudolinear drawings) have played an important role as they are a natural combinatorial extension of rectilinear (or straight-line) drawings. A characterization of the pseudolinear drawings of Kn was found recently. We extend this characterization to all graphs, by describing the set of minimal forbidden subdrawings for pseudolinear drawings. Our characterization also leads to a polynomial-time algorithm to recognize pseudolinear drawings and construct the pseudolines when it is possible.
Fichier principal
Vignette du fichier
main.pdf (570.45 Ko) Télécharger le fichier
Origin Files produced by the author(s)
Loading...

Dates and versions

hal-02471760 , version 1 (19-02-2020)

Identifiers

  • HAL Id : hal-02471760 , version 1

Cite

Alan Arroyo, Julien Bensmail, R. Bruce Richter. Extending Drawings of Graphs to Arrangements of Pseudolines. SoCG 2020 - 36th International Symposium on Computational Geometry, Jun 2020, Zürich, Switzerland. ⟨hal-02471760⟩
84 View
70 Download

Share

Gmail Mastodon Facebook X LinkedIn More