
Simultaneous Matrix Orderings for Graph Collections
Undirected graphs are frequently used to model networks. The topology of...
read it

NearDelaunay Metrics
We study metrics that assess how close a triangulation is to being a Del...
read it

Obstructing Classification via Projection
Machine learning and data mining techniques are effective tools to class...
read it

Route Reconstruction from Traffic Flow via Representative Trajectories
Understanding human mobility is an important aspect of traffic analysis ...
read it

Spatially and Temporally Coherent Visual Summaries
When exploring large timevarying data sets, visual summaries are a usef...
read it

Computing Stable Demers Cartograms
Cartograms are popular for visualizing numerical data for map regions. M...
read it

Geometry and Generation of a New Graph Planarity Game
We introduce a new abstract graph game, Swap Planarity, where the goal i...
read it

Stability analysis of kinetic orientationbased shape descriptors
We study three orientationbased shape descriptors on a set of continuou...
read it

Convex Polygons in Cartesian Products
We study several problems concerning convex polygons whose vertices lie ...
read it

Topological Stability of Kinetic kCenters
We study the kcenter problem in a kinetic setting: given a set of conti...
read it

Short Plane Supports for Spatial Hypergraphs
A graph G=(V,E) is a support of a hypergraph H=(V,S) if every hyperedge ...
read it

Experimental analysis of the accessibility of drawings with few segments
The visual complexity of a graph drawing is defined as the number of geo...
read it

The Painter's Problem: covering a grid with colored connected polygons
Motivated by a new way of visualizing hypergraphs, we study the followin...
read it
Wouter Meulemans
is this you? claim profile