20 citations · 54 across the 21 of their papers we have counts for
28 papers
Locally Correct Interleavings between Merge Trees
Thijs Beurskens, Tim Ophelders, Bettina Speckmann +1
Temporal sequences of terrains arise in various application areas. To analyze them efficiently, one generally needs a suitable abstraction of the data as well as a method to compar…
Wallpaper Group-Based Mechanical Metamaterials: Dataset Including Mechanical Responses
Fleur Hendriks, Vlado Menkovski, Martin Doškář +3
Mechanical metamaterials often exhibit pattern transformations through instabilities, enabling applications in, e.g., soft robotics, sound reduction, and biomedicine. These transfo…
ParkView: Visualizing Monotone Interleavings
Thijs Beurskens, Steven van den Broek, Arjen Simons +5
Merge trees are a powerful tool from topological data analysis that is frequently used to analyze scalar fields. The similarity between two merge trees can be captured by an interl…
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…
Polycubes via Dual Loops
Maxim Snoep, Bettina Speckmann, Kevin Verbeek
In this paper we study polycubes: orthogonal polyhedra with axis-aligned quadrilateral faces. We present a complete characterization of polycubes of any genus based on their dual s…
Robust Construction of Polycube Segmentations via Dual Loops
Maxim Snoep, Bettina Speckmann, Kevin Verbeek
Polycube segmentations for 3D models effectively support a wide variety of applications such as seamless texture mapping, spline fitting, structured multi-block grid generation, an…
Relating Interleaving and Fréchet Distances via Ordered Merge Trees
Thijs Beurskens, Tim Ophelders, Bettina Speckmann +1
Merge trees are a common topological descriptor for data with a hierarchical component, such as terrains and scalar fields. The interleaving distance, in turn, is a common distance…
Better Hit the Nail on the Head than Beat around the Bush: Removing Protected Attributes with a Single Projection
Pantea Haghighatkhah, Antske Fokkens, Pia Sommerauer +2
Bias elimination and recent probing studies attempt to remove specific information from embedding spaces. Here it is important to remove as much of the target information as possib…
Density Approximation for Moving Groups
Max van Mulken, Bettina Speckmann, Kevin Verbeek
Sets of moving entities can form groups which travel together for significant amounts of time. Tracking such groups is an important analysis task in a variety of areas, such as wil…
Computing the Fréchet Distance Between Uncertain Curves in One Dimension
Kevin Buchin, Maarten Löffler, Tim Ophelders +3
We consider the problem of computing the Fréchet distance between two curves for which the exact locations of the vertices are unknown. Each vertex may be placed in a given uncerta…
Obstructing Classification via Projection
Pantea Haghighatkhah, Wouter Meulemans, Bettina Speckman +2
Machine learning and data mining techniques are effective tools to classify large amounts of data. But they tend to preserve any inherent bias in the data, for example, with regard…
Polygon-Universal Graphs
Tim Ophelders, Ignaz Rutter, Bettina Speckmann +1
We study a fundamental question from graph drawing: given a pair of a graph and a cycle in together with a simple polygon , is there a straight-line drawing…
Route Reconstruction from Traffic Flow via Representative Trajectories
Bram Custers, Wouter Meulemans, Bettina Speckmann +1
Understanding human mobility is an important aspect of traffic analysis and urban planning. Trajectories provide detailed views on specific routes, but typically do not capture all…
Stable Visual Summaries for Trajectory Collections
Jules Wulms, Juri Buchmüller, Wouter Meulemans +2
The availability of devices that track moving objects has led to an explosive growth in trajectory data. When exploring the resulting large trajectory collections, visual summaries…
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…
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…
Stability analysis of kinetic orientation-based shape descriptors
Wouter Meulemans, Kevin Verbeek, Jules Wulms
We study three orientation-based shape descriptors on a set of continuously moving points: the first principal component, the smallest oriented bounding box and the thinnest strip.…
Topological Stability of Kinetic -Centers
Ivor van der Hoog, Marc van Kreveld, Wouter Meulemans +2
We study the -center problem in a kinetic setting: given a set of continuously moving points in the plane, determine a set of (moving) disks that cover at every time…
Optimal Morphs of Planar Orthogonal Drawings
Arthur van Goethem, Kevin Verbeek
We describe an algorithm that morphs between two planar orthogonal drawings and of a connected graph , while preserving planarity and orthogonality. Necessarily $Γ_I…
Balanced partitions of 3-colored geometric sets in the plane
Sergey Bereg, Matias Korman, Rodrigo I. Silveira +6
Let be a finite set of geometric objects partitioned into classes or \emph{colors}. A subset is said to be \emph{balanced} if contains the same amount of e…
Non-crossing paths with geographic constraints
Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek
A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geog…
Agglomerative Clustering of Growing Squares
Thom Castermans, Bettina Speckmann, Frank Staals +1
We study an agglomerative clustering problem motivated by interactive glyphs in geo-visualization. Consider a set of disjoint square glyphs on an interactive map. When the user zoo…
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…
Mapping polygons to the grid with small Hausdorff and Fréchet distance
Quirijn W. Bouts, Irina Kostitsyna, Marc van Kreveld +3
We show how to represent a simple polygon by a grid (pixel-based) polygon that is simple and whose Hausdorff or Fréchet distance to is small. For any simple polygon …