30 citations · 104 across the 28 of their papers we have counts for
4 papers · 1 filter
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…
Experimental analysis of the accessibility of drawings with few segments
Philipp Kindermann, Wouter Meulemans, André Schulz
The visual complexity of a graph drawing is defined as the number of geometric objects needed to represent all its edges. In particular, one object may represent multiple edges, e.…
A Framework for Algorithm Stability
Wouter Meulemans, Bettina Speckmann, Kevin Verbeek +1
We say that an algorithm is stable if small changes in the input result in small changes in the output. This kind of algorithm stability is particularly relevant when analyzing and…
Drawing Planar Graphs with Few Geometric Primitives
Gregor Hültenschmidt, Philipp Kindermann, Wouter Meulemans +1
We define the \emph{visual complexity} of a plane graph drawing to be the number of basic geometric objects needed to represent all its edges. In particular, one object may represe…