2 citations · 2 across the 2 of their papers we have counts for
Showing cs.CGShow all
2 papers · 1 filter
cs.CG2024
Morphing Planar Graph Drawings via Orthogonal Box Drawings
Therese Biedl, Anna Lubiw, Jack Spalding-Jamieson
We give an algorithm to morph planar graph drawings that achieves small grid size at the expense of allowing a constant number of bends on each edge. The input is an -vertex pla…
cs.CG2019★ 2 cited
Angle Covers: Algorithms and Complexity
William Evans, Ellen Gethner, Jack Spalding-Jamieson +1
Consider a graph with a rotation system, namely, for every vertex, a circular ordering of the incident edges. Given such a graph, an angle cover maps every vertex to a pair of cons…