6 papers
On t-colorable k-plane drawings
Miriam Goetze, Michael Kaufmann, Soeren Terziadis
In this work, we introduce -colorable -plane drawings, that is, drawings of graphs with a -edge-coloring where every edge is crossed by at most edges of each color. We…
On the -Bend Slope Number of -Planar Graphs
Michael A. Bekos, Eleni Katsanou, Philipp Kindermann +3
While drawing planar graphs with few slopes and few bends is a well-studied problem, corresponding extensions to beyond-planar graphs still remain mostly unexplored. Motivated by t…
Clarity and Computational Efficiency of Orbital Boundary Labeling
Markus Wallinger, Annika Bonerath, Soeren Terziadis +2
Circular interfaces such as those found on smartwatches, automotive dashboards, cockpit instruments, or in radial visualizations pose unique challenges for placing readable labels.…
Constrained Boundary Labeling
Thomas Depian, Martin Nöllenburg, Soeren Terziadis +1
Boundary labeling is a technique in computational geometry used to label sets of features in an illustration. It involves placing labels along an axis-parallel bounding box and con…
On Solving Simple Curved Nonograms
Maarten Löffler, Günter Rote, Soeren Terziadis +1
Nonograms are a popular type of puzzle, where an arrangement of curves in the plane (in the classic version, a rectangular grid) is given together with a series of hints, indicatin…
Saturated Drawings of Geometric Thickness k
Patricia Bachmann, Anna Brötzner, Miriam Goetze +3
We investigate saturated geometric drawings of graphs with geometric thickness , where no edge can be added without increasing . We establish lower and upper bounds on the nu…