4 citations · 4 across the 3 of their papers we have counts for
8 papers · 1 filter
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…
A near-linear time exact algorithm for the -geodesic Fréchet distance between two curves on the boundary of a simple polygon
Thijs van der Horst, Marc van Kreveld, Tim Ophelders +1
Let be a polygon with vertices. Let and be two simple, interior disjoint curves on the boundary of , with and vertices. We show how to compute the Fréche…
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…
The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon
Thijs van der Horst, Marc van Kreveld, Tim Ophelders +1
The Fréchet distance is a popular similarity measure that is well-understood for polygonal curves in : near-quadratic time algorithms exist, and conditional lower bou…
Faster Fréchet Distance Approximation through Truncated Smoothing
Thijs van der Horst, Marc van Kreveld, Tim Ophelders +1
The Fréchet distance is a commonly used distance measure for curves. Computing the Fréchet distance between two polygonal curves of vertices takes roughly quadratic time, and c…
Robust Bichromatic Classification using Two Lines
Erwin Glazenburg, Thijs van der Horst, Tom Peters +2
Given two sets and of points in the plane, we present efficient algorithms to find a two-line linear classifier that best separates the "red" points in from the "bl…
Optimal In-Place Compaction of Sliding Cubes
Irina Kostitsyna, Tim Ophelders, Irene Parada +3
The sliding cubes model is a well-established theoretical framework that supports the analysis of reconfiguration algorithms for modular robots consisting of face-connected cubes.…
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…