31 citations · 135 across the 32 of their papers we have counts for
29 papers · 1 filter
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…
A Subquadratic -approximation for the Continuous Fréchet Distance
Thijs van der Horst, Marc van Kreveld, Tim Ophelders +1
The Fréchet distance is a commonly used similarity measure between curves. It is known how to compute the continuous Fréchet distance between two polylines with and vertice…
Near-Delaunay Metrics
Nathan van Beusekom, Kevin Buchin, Hidde Koerts +3
We study metrics that assess how close a triangulation is to being a Delaunay triangulation, for use in contexts where a good triangulation is desired but constraints (e.g., maximu…
Crossing Numbers of Beyond-Planar Graphs Revisited
Nathan van Beusekom, Irene Parada, Bettina Speckmann
Graph drawing beyond planarity focuses on drawings of high visual quality for non-planar graphs which are characterized by certain forbidden edge configurations. A natural criterio…
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…