Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier

DOI10.4230/LIPICS.ICALP.2017.25zbMATH Open1441.68304OpenAlexW2902891590MaRDI QIDQ5111355FDOQ5111355

Authors: Omer Gold, Micha Sharir 

Publication date: 27 May 2020

Full work available at URL: https://doi.org/10.4230/LIPIcs.ICALP.2017.25

Recommendations

• Dynamic time warping and geometric edit distance: breaking the quadratic barrier
• Approximating dynamic time warping and edit distance for a pair of point sequences
• Towards Efficient Interactive Computation of Dynamic Time Warping Distance
• Fast exact dynamic time warping on run-length encoded time series
• Faster retrieval with a two-pass dynamic-time-warping lower bound

zbMATH Keywords

time seriesdynamic time warpingpoint matchinggeometric matchinggeometric edit distance

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Cited In (8)

• The one-way communication complexity of dynamic time warping distance
• Dynamic Time Warping in Strongly Subquadratic Time: Algorithms for the Low-Distance Regime and Approximate Evaluation
• Dynamic time warping and geometric edit distance: breaking the quadratic barrier
• Approximating dynamic time warping and edit distance for a pair of point sequences
• Title not available (Why is that?)
• Quaternion Dynamic Time Warping
• Towards Efficient Interactive Computation of Dynamic Time Warping Distance
• Curve matching, time warping, and light fields: New algorithms for computing similarity between curves

This page was built for publication: Dynamic Time Warping and Geometric Edit Distance: Breaking the Quadratic Barrier

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111355)