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 |
| Journal | ACM Transactions on Algorithms |
| Volume | 19 |
| Issue number | 4 |
| DOIs | |
| State | Published - 25 Oct 2023 |
Bibliographical note
Publisher Copyright:© 2023 Copyright held by the owner/author(s). Publication rights licensed to ACM.
Keywords
- Fréchet distance
- distance oracle
- high dimension
- simplification
- streaming algorithm
- the "zoom in" problem
Fingerprint
Dive into the research topics of 'Static and Streaming Data Structures for Fréchet Distance Queries'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver