Anne Driemel

From MaRDI portal



List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

PublicationDate of PublicationType
Tight bounds for approximate near neighbor searching for time series under the Fréchet distance2024-07-19Paper
On computing the \(k\)-shortcut Fréchet distance2024-06-24Paper
Minimum-error triangulations for sea surface reconstruction2024-05-14Paper
On the discrete Fréchet distance in a graph2024-05-14Paper
\((1+\varepsilon)\)-ANN data structure for curves via subspaces of bounded doubling dimension
(available as arXiv preprint)
2024-04-02Paper
On the discrete Fréchet distance in a graph
(available as arXiv preprint)
2024-02-01Paper
On the discrete Fréchet distance in a graph2024-02-01Paper
scientific article; zbMATH DE number 7788498 (Why is no real title available?)2024-01-15Paper
Minimum-error triangulations for sea surface reconstruction
(available as arXiv preprint)
2023-12-20Paper
Minimum-error triangulations for sea surface reconstruction2023-12-20Paper
On the Hardness of Computing an Average Curve.
(available as arXiv preprint)
2023-11-02Paper
Introduction to the Special Issue on ACM-SIAM Symposium on Discrete Algorithms (SODA) 2020
ACM Transactions on Algorithms
2023-10-31Paper
Approximating ( k,ℓ )-Median Clustering for Polygonal Curves
ACM Transactions on Algorithms
2023-10-23Paper
Pattern matching under DTW distance
String Processing and Information Retrieval
2023-08-04Paper
Approximating length-restricted means under dynamic time warping
Approximation and Online Algorithms
2023-07-25Paper
scientific article; zbMATH DE number 7662168 (Why is no real title available?)
(available as arXiv preprint)
2023-03-10Paper
scientific article; zbMATH DE number 7559228 (Why is no real title available?)2022-07-18Paper
Algorithmic geometry. Foundations, methods, applications2022-06-15Paper
ANN for time series under the Fréchet distance2022-03-25Paper
The VC dimension of metric balls under Fréchet and Hausdorff distances
Discrete & Computational Geometry
2021-11-18Paper
FRESH: Fréchet similarity with hashing
(available as arXiv preprint)
2020-01-16Paper
Approximating \((k,\ell)\)-center clustering for curves
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-10-15Paper
Segmentation of trajectories on non-monotone criteria
Proceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms
2019-05-15Paper
Jaywalking your dog: computing the Fréchet distance with shortcuts2019-05-10Paper
Probabilistic embeddings of the Fréchet distance
(available as arXiv preprint)
2019-01-15Paper
On the expected complexity of Voronoi diagrams on terrains
ACM Transactions on Algorithms
2018-11-05Paper
Segmentation of trajectories on nonmonotone criteria
ACM Transactions on Algorithms
2018-10-30Paper
Locality-sensitive hashing of curves
(available as arXiv preprint)
2018-08-13Paper
Clustering time series under the Fréchet distance
Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms
2018-07-16Paper
Computing the Fréchet distance with shortcuts is NP-hard
Proceedings of the thirtieth annual symposium on Computational geometry
2018-04-23Paper
On the complexity of range searching among curves2018-03-15Paper
On the complexity of range searching among curves
(available as arXiv preprint)
2018-03-15Paper
Flow computations on imprecise terrains2017-03-09Paper
Computing the Fréchet distance between folded polygons
Computational Geometry
2016-01-15Paper
On the expected complexity of Voronoi diagrams on terrains
Proceedings of the twenty-eighth annual symposium on Computational geometry
2014-08-07Paper
Approximating the Fréchet distance for realistic curves in near linear time
Proceedings of the twenty-sixth annual symposium on Computational geometry
2014-04-03Paper
Jaywalking your dog: computing the Fréchet distance with shortcuts
SIAM Journal on Computing
2014-02-04Paper
Approximating the Fréchet distance for realistic curves in near linear time
Discrete & Computational Geometry
2012-08-13Paper
Computing the Fréchet distance between folded polygons
Lecture Notes in Computer Science
2011-08-12Paper
Flow Computations on Imprecise Terrains
Lecture Notes in Computer Science
2011-08-12Paper
Flow Computations on Imprecise Terrains
Lecture Notes in Computer Science
2011-08-12Paper


Research outcomes over time


This page was built for person: Anne Driemel