1 citations · 1 across the 1 of their papers we have counts for
2 papers
cs.CG2019
Optimal Morphs of Planar Orthogonal Drawings II
Arthur van Goethem, Bettina Speckmann, Kevin Verbeek
Van Goethem and Verbeek recently showed how to morph between two planar orthogonal drawings and of a connected graph while preserving planarity, orthogonality, and…
cs.CG2017★ 1 cited
The Painter's Problem: covering a grid with colored connected polygons
Arthur van Goethem, Irina Kostitsyna, Marc van Kreveld +3
Motivated by a new way of visualizing hypergraphs, we study the following problem. Consider a rectangular grid and a set of colors . Each cell in the grid is assigned a subs…