Abstract
Given a curve P with points in ℝd in a streaming fashion, and parameters ϵ > 0 and k, we construct a distance oracle that uses space, and given a query curve Q with k points in ℝd returns in time a 1+ϵ approximation of the discrete Fréchet distance between Q and P.In addition, we construct simplifications in the streaming model, oracle for distance queries to a sub-curve (in the static setting), and introduce the zoom-in problem. Our algorithms work in any dimension d, and therefore we generalize some useful tools and algorithms for curves under the discrete Fréchet distance to work efficiently in high dimensions.
Original language | English |
---|---|
Article number | 39 |
Pages (from-to) | 39:1-39:36 |
Number of pages | 36 |
Journal | ACM Transactions on Algorithms |
Volume | 19 |
Issue number | 4 |
DOIs | |
State | Published - 25 Oct 2023 |
Event | 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 - Alexandria, Virtual, United States Duration: 10 Jan 2021 → 13 Jan 2021 |
Keywords
- Fréchet distance
- distance oracle
- high dimension
- simplification
- streaming algorithm
- the "zoom in" problem
All Science Journal Classification (ASJC) codes
- Mathematics (miscellaneous)