9 citations · 19 across the 18 of their papers we have counts for
7 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…
Counting Triangulations of Fixed Cardinal Degrees
Erin Chambers, Tim Ophelders, Anna Schenfisch +1
A fixed set of vertices in the plane may have multiple planar straight-line triangulations in which the degree of each vertex is the same. As such, the degree information does not…
Computing the Fréchet Distance When Just One Curve is -Packed: A Simple Almost-Tight Algorithm
Jacobus Conradi, Ivor van der Hoog, Thijs van der Horst +1
We study approximating the continuous Fréchet distance of two curves with complexity and , under the assumption that only one of the two curves is -packed. Driemel, Har{-…
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…
Sweeping Orders for Simplicial Complex Reconstruction
Tim Ophelders, Anna Schenfisch
Standard sweep algorithms require an order of discrete points in Euclidean space, and rely on the property that, at a given point, all points in the halfspace below come earlier in…