Computing the similarity between moving curves
From MaRDI portal
DOI10.1016/j.comgeo.2017.01.002zbMath1443.68199arXiv1507.03819OpenAlexW4210272815WikidataQ59782242 ScholiaQ59782242MaRDI QIDQ1615772
Kevin Buchin, Tim Ophelders, Bettina Speckmann
Publication date: 31 October 2018
Published in: Computational Geometry, Algorithms - ESA 2015 (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1507.03819
Cites Work
- Unnamed Item
- Approximating the Fréchet distance for realistic curves in near linear time
- Fréchet distance with speed limits
- Can we compute the similarity between surfaces?
- Computing the Fréchet distance between simple polygons
- DETECTING COMMUTING PATTERNS BY CLUSTERING SUBTRAJECTORIES
- On Computing the Fréchet Distance Between Surfaces.
- Fréchet Distance of Surfaces: Some Simple Hard Cases
- Applying Parallel Computation Algorithms in the Design of Serial Algorithms
- Matching planar maps
- Computing the Fréchet Distance between Real-Valued Surfaces
- Slowing down sorting networks to obtain faster sorting algorithms
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Computing the Fréchet Distance between Folded Polygons
- Four Soviets Walk the Dog—with an Application to Alt's Conjecture
- The frechet distance revisited and extended
- Fréchet Distance for Curves, Revisited
This page was built for publication: Computing the similarity between moving curves