5 papers
Hypergraphs as Metro Maps: Drawing Paths with Few Bends in Trees, Cacti, and Plane 4-Graphs
Sabine Cornelsen, Henry Förster, Siddharth Gupta +2
A hypergraph consists of a set of vertices and a set of subsets of vertices, called hyperedges. In the metro map metaphor, each hyperedge is represented by a path (the metro line)…
Visualization Biases MLLM's Decision Making in Network Data Tasks
Timo Brand, Henry Förster, Stephen G. Kobourov +1
We evaluate how visualizations can influence the judgment of MLLMs about the presence or absence of bridges in a network. We show that the inclusion of visualization improves confi…
Embedding Trees and Cactus Graphs with Integer Edge Lengths on a Compact Integer Grid
Henry Förster, Aaron Büngener, Stephen Kobourov +2
Every planar graph can be embedded with crossing-free, straight-line edges on an integer grid, where is the number of vertices. It is not known, however, whe…
GraphTrials: Visual Proofs of Graph Properties
Henry Förster, Felix Klesen, Tim Dwyer +8
Graph and network visualization supports exploration, analysis and communication of relational data arising in many domains: from biological and social networks, to transportation…
On Smooth Orthogonal and Octilinear Drawings: Relations, Complexity and Kandinsky Drawings
Michael A. Bekos, Henry Förster, Michael Kaufmann
We study two variants of the well-known orthogonal drawing model: (i) the smooth orthogonal, and (ii) the octilinear. Both models form an extension of the orthogonal, by supporting…