20 citations · 29 across the 9 of their papers we have counts for
14 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…
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…
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…
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…