1 citations · 1 across the 1 of their papers we have counts for
3 papers
Computing Stable Demers Cartograms
Soeren Nickel, Max Sondag, Wouter Meulemans +4
Cartograms are popular for visualizing numerical data for map regions. Maintaining correct adjacencies is a primary quality criterion for cartograms. When there are multiple data v…
Quantitative Comparison of Time-Dependent Treemaps
Eduardo Vernier, Max Sondag, Joao Comba +3
Rectangular treemaps are often the method of choice to visualize large hierarchical datasets. Nowadays such datasets are available over time, hence there is a need for (a) treemaps…
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…