36 citations · 49 across the 16 of their papers we have counts for
6 papers · 1 filter
Minimum-Width Drawing of Trees with Sized Vertices
Markus Wallinger, Oscar Navarro, Stephen G. Kobourov
Trees arise in many applications and computing nice tree layouts is a classical problem in information visualization. In many practical settings, vertices need to be represented as…
Using Reinforcement Learning to Optimize the Global and Local Crossing Number
Timo Brand, Henry Förster, Stephen Kobourov +4
Graph drawing concerns the algorithmic visualization of graphs. A good drawing of a graph is easy to read and facilitates solving tasks on the graph. Several properties have been i…
Boundary Labeling in a Circular Orbit
Annika Bonerath, Martin Nöllenburg, Soeren Terziadis +2
Boundary labeling is a well-known method for displaying short textual labels for a set of point features in a figure alongside the boundary of that figure. Labels and their corresp…
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…
Computing Hive Plots: A Combinatorial Framework
Martin Nöllenburg, Markus Wallinger
Hive plots are a graph visualization style placing vertices on a set of radial axes emanating from a common center and drawing edges as smooth curves connecting their respective en…
Splitting Vertices in 2-Layer Graph Drawings
Reyan Ahmed, Patrizio Angelini, Michael A. Bekos +8
Bipartite graphs model the relationships between two disjoint sets of entities in several applications and are naturally drawn as 2-layer graph drawings. In such drawings, the two…