4 papers · 1 filter
Edge-Constrained Hamiltonian Paths on a Point Set
Todor Antić, Aleksa Džuklevski, Jiří Fiala +5
Let S be a set of distinct points in general position in the Euclidean plane. A plane Hamiltonian path on S is a crossing-free geometric path such that every point of S is a vertex…
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)…
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…
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…