4 citations · 4 across the 2 of their papers we have counts for
5 papers
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…
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.…
Compacting Squares: Input-Sensitive In-Place Reconfiguration of Sliding Squares
Hugo A. Akitaya, Erik D. Demaine, Matias Korman +6
A well-established theoretical model for modular robots in two dimensions are edge-connected configurations of square modules, which can reconfigure through so-called sliding moves…
Between Shapes, Using the Hausdorff Distance
Marc van Kreveld, Tillmann Miltzow, Tim Ophelders +2
Given two shapes and in the plane with Hausdorff distance , is there a shape with Hausdorff distance to and from and ? The answer is always yes, and dep…
Mapping polygons to the grid with small Hausdorff and Fréchet distance
Quirijn W. Bouts, Irina Kostitsyna, Marc van Kreveld +3
We show how to represent a simple polygon by a grid (pixel-based) polygon that is simple and whose Hausdorff or Fréchet distance to is small. For any simple polygon …