89 citations · 484 across the 68 of their papers we have counts for
Showing cs.CGShow all
3 papers · 1 filter
cs.CG2022
Dynamic Time Warping Under Translation: Approximation Guided by Space-Filling Curves
Karl Bringmann, Sándor Kisfaludi-Bak, Marvin Künnemann +2
The Dynamic Time Warping (DTW) distance is a popular measure of similarity for a variety of sequence data. For comparing polygonal curves in , it provides a ro…
cs.CG2019
How does object fatness impact the complexity of packing in d dimensions?
Sándor Kisfaludi-Bak, Dániel Marx, Tom C. van der Zanden
Packing is a classical problem where one is given a set of subsets of Euclidean space called objects, and the goal is to find a maximum size subset of objects that are pairwise non…
cs.CG2016★ 9 cited
Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems
Dániel Marx, Tillmann Miltzow
Given a set of points in the plane, a triangulation of is a maximal set of non-crossing segments with endpoints in . We present an algorithm that computes the nu…