ملخص
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.
اللغة الأصلية | الإنجليزيّة |
---|---|
رقم المقال | 4 |
الصفحات (من إلى) | 39:1-39:36 |
عدد الصفحات | 36 |
دورية | ACM Transactions on Algorithms |
مستوى الصوت | 19 |
رقم الإصدار | 4 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | نُشِر - 25 أكتوبر 2023 |
الحدث | 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2021 - Alexandria, Virtual, الولايات المتّحدة المدة: ١٠ يناير ٢٠٢١ → ١٣ يناير ٢٠٢١ |
ملاحظة ببليوغرافية
Publisher Copyright:© 2023 Copyright held by the owner/author(s). Publication rights licensed to ACM.