Algorithms and Complexity Group
  • People
  • Research
  • Courses
  • Talks
  • Jobs
  • Contact

Two Sided Circular Layouts

Two-Sided Circular Layouts are a technique of enhancing circular graph drawings by finding a set of edges, which is then to be drawn in the outer face. On this website you find the code and test data used in the paper Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts by Fabian Klute and Martin Nöllenburg, presented at SoCG'18 in Budapest.

The here displayed pictures show, from left to right, a circular layout generated with OGDF, a two-sided layout with crossing free edges in the outer face and a two-sided layout with up to one crossing per edge in the outer face. The code is available in the following archive:

two_sided.tar.gz

and the instances under:

instances.tar.gz.

The code comes with a qmake project file. The easiest way to build it is to use the QtCreator IDE.

From the paper:

Circular graph layout is a popular drawing style, in which vertices are placed on a circle and edges are drawn as straight chords. Crossing minimization in circular layouts is NP-hard. One way to allow for fewer crossings in practice are two-sided layouts that draw some edges as curves in the exterior of the circle. In fact, one- and two-sided circular layouts are equivalent to one-page and two-page book drawings, i.e., graph layouts with all vertices placed on a line (the spine) and edges drawn in one or two distinct half-planes (the pages) bounded by the spine. In this paper we study the problem of minimizing the crossings for a fixed cyclic vertex order by computing an optimal \(k\)-plane set of exteriorly drawn edges for \(k \ge 1\), extending the previously studied case \(k=0\). We show that this relates to finding bounded-degree maximum-weight induced subgraphs of circle graphs, which is a graph-theoretic problem of independent interest. We show NP-hardness for arbitrary \(k\), present an efficient algorithm for \(k=1\), and generalize it to an explicit XP-time algorithm for any fixed \(k\). For the practically interesting case \(k=1\) we implemented our algorithm and present experimental results that confirm its applicability.

News

  • Best paper award at EvoCOP 2022

    Best paper award at EvoCOP 2022

    2022-05-24
    Jonas Mayerhofer, Markus Kirchweger, Marc Huber, and Günther Raidl received the best paper award for their work A Beam Search …Read More »
  • New PhD: Guangping Li

    New PhD: Guangping Li

    2022-05-13
    Guangping Li successfully defended her PhD thesis “An Algorithmic Study of Practical Map Labeling” on May 13, 2022. Congratulations, Dr. …Read More »
  • Outstanding results for TU Wien students at the 2021 Graph Drawing Contest

    Outstanding results for TU Wien students at the 2021 Graph Drawing Contest

    2021-09-24
    The 28th Annual Graph Drawing Contest, a long running tradition of the graph drawing research community, was held in conjunction …Read More »
  • Jan Dreier receives a LICS’21 Distinguished Paper Award

    Jan Dreier receives a LICS’21 Distinguished Paper Award

    2021-07-02
    Congratulations to Jan Dreier for his LICS 2021 Distinguished Paper Award for his paper Lacon- and Shrub-Decompositions: A New Characterization …Read More »
  • Lecture at Austrian Parliament

    Lecture at Austrian Parliament

    2021-06-16
    Stefan Szeider and Martin Kronegger gave a lecture on Algorithms and Programming to members of the Austrian Parliament. The lecture …Read More »

News archive

All news for 2015, 2016, 2017, 2018, 2019, 2020 and 2021.
TU Wien Informatics
Offenlegung (§25 MedienG) Inhaber der Website ist das Institut für Logic and Computation an der Technischen Universität Wien, 1040 Wien. Die TU Wien distanziert sich von den Inhalten aller extern gelinkten Seiten und übernimmt diesbezüglich keine Haftung. – Disclaimer – Datenschutzerklärung
Log in requires cookies.