Document Open Access Logo

Extending Drawings of Graphs to Arrangements of Pseudolines

Authors Alan Arroyo , Julien Bensmail, R. Bruce Richter

PDF

File

Thumbnail PDF
PDF
LIPIcs.SoCG.2020.9.pdf
  • Filesize: 0.56 MB
  • 14 pages

Document Identifiers

Related Versions

Subject Classification

ACM Subject Classification
  • Mathematics of computing → Graph algorithms
  • Mathematics of computing → Graphs and surfaces
Keywords
  • graphs
  • graph drawings
  • geometric graph drawings
  • arrangements of pseudolines
  • crossing numbers
  • stretchability

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
    0
    Metadata Views

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 K_n 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.

Cite As Get BibTex

Alan Arroyo, Julien Bensmail, and R. Bruce Richter. Extending Drawings of Graphs to Arrangements of Pseudolines. In 36th International Symposium on Computational Geometry (SoCG 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 164, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020) https://doi.org/10.4230/LIPIcs.SoCG.2020.9

Author Details

Alan Arroyo
  • IST Austria, Klosterneuburg, Austria
Julien Bensmail
  • Université Côte d'Azur, CNRS, Inria, I3S, Sophia-Antipolis, France
R. Bruce Richter
  • Department of Combinatorics and Optimization, University of Waterloo, Canada

Funding

  • Arroyo, Alan: Supported by CONACYT. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 754411.
  • Bensmail, Julien: ERC Advanced Grant GRACOL, project no. 320812.
  • Richter, R. Bruce: Supported by NSERC grant number 50503-10940-500.

References

  1. Bernardo M Ábrego and Silvia Fernández-Merchant. A lower bound for the rectilinear crossing number. Graphs and Combinatorics, 21(3):293-300, 2005. Google Scholar
  2. Oswin Aichholzer, Thomas Hackl, Alexander Pilz, Birgit Vogtenhuber, and G Salazar. Deciding monotonicity of good drawings of the complete graph. In Encuentros de Geometría Computacional, pages 33-36. ., 2015. Google Scholar
  3. Alan Arroyo. On Geometric Drawings of Graphs. PhD thesis, University of Waterloo, 2018. Google Scholar
  4. Alan Arroyo, Julien Bensmail, and R Bruce Richter. Extending drawings of graphs to arrangements of pseudolines. arXiv preprint, 2018. URL: http://arxiv.org/abs/1804.09317.
  5. Alan Arroyo, Dan McQuillan, R Bruce Richter, and Gelasio Salazar. Levi’s lemma, pseudolinear drawings of, and empty triangles. Journal of Graph Theory, 87(4):443-459, 2018. Google Scholar
  6. Martin Balko, Radoslav Fulek, and Jan Kynčl. Crossing numbers and combinatorial characterization of monotone drawings of K_n. Discrete & Computational Geometry, 53(1):107-143, 2015. Google Scholar
  7. József Balogh, Jesús Lea~nos, Shengjun Pan, R Bruce Richter, and Gelasio Salazar. The convex hull of every optimal pseudolinear drawing of K_n is a triangle. Australasian Journal of Combinatorics, 38:155, 2007. Google Scholar
  8. Daniel Bienstock and Nathaniel Dean. Bounds for rectilinear crossing numbers. Journal of Graph Theory, 17(3):333-348, 1993. Google Scholar
  9. Peter Eades, Seok-Hee Hong, Giuseppe Liotta, Naoki Katoh, and Sheung-Hung Poon. Straight-line drawability of a planar graph plus an edge. arXiv preprint, 2015. URL: http://arxiv.org/abs/1504.06540.
  10. Stefan Felsner. Geometric graphs and arrangements: some chapters from combinatorial geometry. Springer Science & Business Media, 2012. Google Scholar
  11. Stefan Felsner and Jacob E Goodman. Pseudoline arrangements. In Handbook of Discrete and Computational Geometry, pages 125-157. Chapman and Hall/CRC, 2017. Google Scholar
  12. César Hernández-Vélez, Jesús Lea~nos, and Gelasio Salazar. On the pseudolinear crossing number. Journal of Graph Theory, 84(3):155-162, 2017. Google Scholar
  13. László Lovász, Katalin Vesztergombi, Uli Wagner, and Emo Welzl. Convex quadrilaterals and k-sets. Contemporary Mathematics, 342:139-148, 2004. Google Scholar
  14. Nicolai E Mnëv. Varieties of combinatorial types of projective configurations and convex polytopes. Doklady Akademii Nauk SSSR, 283(6):1312-1314, 1985. Google Scholar
  15. Nikolai E Mnëv. The universality theorems on the classification problem of configuration varieties and convex polytopes varieties. In Topology and geometry - Rohlin seminar, pages 527-543. Springer, 1988. Google Scholar
  16. Carsten Thomassen. Rectilinear drawings of graphs. Journal of Graph Theory, 12(3):335-341, 1988. Google Scholar
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact