3 papers
cs.CG2025
Minimizing Vertical Length in Linked Bar Charts
Steven van den Broek, Marc van Kreveld, Wouter Meulemans +1
A linked bar chart is the augmentation of a traditional bar chart where each bar is partitioned into blocks and pairs of blocks are linked using orthogonal lines that pass over int…
cs.CG2025
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…
cs.CG2025
Minimum spanning blob-trees
Katharina Klost, Marc van Kreveld, Daniel Perz +2
We investigate blob-trees, a new way of connecting a set of points, by a mixture of enclosing them by cycles (as in the convex hull) and connecting them by edges (as in a spanning…