6 papers
Dimension Reduction for Curves: Simplified and Generalized
Matthijs Ebbens, Jie Lu, Alexander Munteanu
We revisit random projections for reducing the dimension of high-dimensional polygonal curves. Drawing from the toolbox of randomized linear algebra, we give a considerably simplif…
A Subquadratic Time Approximation Algorithm for Individually Fair k-Center
Matthijs Ebbens, Nicole Funk, Jan Höckendorff +2
We study the -center problem in the context of individual fairness. Let be a set of points in a metric space and be the distance between and its $\lceil…
Computing the second and third systoles of a combinatorial surface
Matthijs Ebbens, Francis Lazarus
Given a weighted, undirected graph cellularly embedded on a topological surface , we describe algorithms to compute the second shortest and third shortest closed walks of $G…
Algorithms for Length Spectra of Combinatorial Tori
Vincent Delecroix, Matthijs Ebbens, Francis Lazarus +1
Consider a weighted, undirected graph cellularly embedded on a topological surface. The function assigning to each free homotopy class of closed curves the length of a shortest cyc…
Delaunay triangulations of generalized Bolza surfaces
Matthijs Ebbens, Iordan Iordanov, Monique Teillaud +1
The Bolza surface can be seen as the quotient of the hyperbolic plane, represented by the Poincaré disk model, under the action of the group generated by the hyperbolic isometries…
Minimal Delaunay triangulations of hyperbolic surfaces
Matthijs Ebbens, Hugo Parlier, Gert Vegter
Motivated by recent work on Delaunay triangulations of hyperbolic surfaces, we consider the minimal number of vertices of such triangulations. First, we will show that every hyperb…