Bettina Speckmann

collaborators

4 papers

cs.CG2025

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…

cs.CG2025

A near-linear time exact algorithm for the $L_{1}$ -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 $P$ be a polygon with $k$ vertices. Let $R$ and $B$ be two simple, interior disjoint curves on the boundary of $P$ , with $n$ and $m$ vertices. We show how to compute the Fréche…

cs.CG2025

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…

cs.CG2025

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 $R^{d}$ : near-quadratic time algorithms exist, and conditional lower bou…

Locally Correct Interleavings between Merge Trees

A near-linear time exact algorithm for the L1​-geodesic Fréchet distance between two curves on the boundary of a simple polygon

ParkView: Visualizing Monotone Interleavings

The Geodesic Fréchet Distance Between Two Curves Bounding a Simple Polygon

A near-linear time exact algorithm for the $L_{1}$ -geodesic Fréchet distance between two curves on the boundary of a simple polygon