activity
20122026
most citedFour Soviets Walk the Dog-Improved Bounds for Computing the Fréchet Distance

30 citations · 104 across the 28 of their papers we have counts for

collaborators
Showing cs.CGShow all

25 papers · 1 filter

cs.CG2026

Automated Responsive Thematic Mapping with Layout Guides

Arjen Simons, Sarah Schöttler, Wouter Meulemans +2

Thematic maps visually communicate statistical information about spatial units such as countries or states. They must balance the individual readability of those map elements that…

cs.CG2025

Minimizing Vertical Length in Linked Bar Charts

Steven van den Broek, Marc van Kreveld, Wouter Meulemans +1

A linked bar chart is the augmentation of a traditional bar chart where each bar is partitioned into blocks and pairs of blocks are linked using orthogonal lines that pass over int…

cs.CG2025

Summarizing Classed Region Maps with a Disk Choreme

Steven van den Broek, Wouter Meulemans, Andreas Reimer +1

Chorematic diagrams are highly reduced schematic maps of geospatial data and processes. They can visually summarize complex situations using only a few simple shapes (choremes) pla…

cs.CG2024

Visual Complexity of Point Set Mappings

Wouter Meulemans, Arjen Simons, Kevin Verbeek

We study the visual complexity of animated transitions between point sets. Although there exist many metrics for point set similarity, these metrics are not adequate for this purpo…

cs.CG2024

SimpleSets: Capturing Categorical Point Patterns with Simple Shapes

Steven van den Broek, Wouter Meulemans, Bettina Speckmann

Points of interest on a map such as restaurants, hotels, or subway stations, give rise to categorical point data: data that have a fixed location and one or more categorical attrib…

cs.CG2024

Greedy Monochromatic Island Partitions

Steven van den Broek, Wouter Meulemans, Bettina Speckmann

Constructing partitions of colored points is a well-studied problem in discrete and computational geometry. We study the problem of creating a minimum-cardinality partition into mo…