1 citations · 1 across the 5 of their papers we have counts for
4 papers
Dynamic Dynamic Time Warping
Karl Bringmann, Nick Fischer, Ivor van der Hoog +3
The Dynamic Time Warping (DTW) distance is a popular similarity measure for polygonal curves (i.e., sequences of points). It finds many theoretical and practical applications, espe…
Adaptive Out-Orientations with Applications
Chandra Chekuri, Aleksander Bjørn Christiansen, Jacob Holm +4
We give improved algorithms for maintaining edge-orientations of a fully-dynamic graph, such that the out-degree of each vertex is bounded. On one hand, we show how to orient the e…
Simple and Robust Dynamic Two-Dimensional Convex Hull
Emil Toftegaard Gæde, Inge Li Gørtz, Ivor van der Hoog +2
The convex hull of a data set is the smallest convex set that contains . In this work, we present a new data structure for convex hull, that allows for efficient dynamic upd…
Maximum-Area Quadrilateral in a Convex Polygon, Revisited
Vahideh Keikha, Maarten Löffler, Ali Mohades +2
In this note we show by example that the algorithm presented in 1979 by Dobkin and Snyder for finding the largest-area k-gon that is inscribed in a convex polygon fails to find the…