Search Results for author:
Found 2 papers, 0 papers with code
Translating Hausdorff is Hard: Fine-Grained Lower Bounds for Hausdorff Distance Under Translation
Computing the similarity of two point sets is a ubiquitous task in medical imaging, geometric shape comparison, trajectory analysis, and many more settings.
Computational Geometry Computational Complexity
(k, l)-Medians Clustering of Trajectories Using Continuous Dynamic Time Warping
We develop the first clustering algorithm under this distance measure and show a practical way to compute a center from a set of trajectories and subsequently iteratively improve it.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
