Abstract
Given a curve P with points in Rd in a streaming fashion, and parameters ε > 0 and k, we construct a distance oracle that uses O(1ε)kd log ε−1 space, and given a query curve Q with k points in Rd, returns in Õ(kd) 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 |
|---|---|
| Title of host publication | ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 |
| Editors | Daniel Marx |
| Publisher | Association for Computing Machinery |
| Pages | 1150-1170 |
| Number of pages | 21 |
| ISBN (Electronic) | 9781611976465 |
| DOIs | |
| State | Published - 2021 |
| Externally published | Yes |
| Event | 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 - Alexandria, Virtual, United States Duration: 10 Jan 2021 → 13 Jan 2021 |
Publication series
| Name | Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms |
|---|---|
| ISSN (Print) | 1071-9040 |
| ISSN (Electronic) | 1557-9468 |
Conference
| Conference | 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 |
|---|---|
| Country/Territory | United States |
| City | Alexandria, Virtual |
| Period | 10/01/21 → 13/01/21 |
Bibliographical note
Publisher Copyright:Copyright © 2021 by SIAM
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