scientific article; zbMATH DE number 7051233
From MaRDI portal
Publication:4633876
zbMATH Open1420.68225MaRDI QIDQ4633876FDOQ4633876
Authors: Kevin Buchin, Maike Buchin, Yusu Wang
Publication date: 6 May 2019
Full work available at URL: https://dl.acm.org/citation.cfm?id=1496841
Title of this publication is not available (Why is that?)
Recommendations
- Approximately matching polygonal curves with respect to the Fréchet distance
- scientific article; zbMATH DE number 1689042
- More flexible curve matching via the partial Fréchet similarity
- Approximating the Fréchet distance for realistic curves in near linear time
- Approximating the Fréchet distance for realistic curves in near linear time
- Improved algorithms for partial curve matching
- Improved algorithms for partial curve matching
- Computing the Fréchet distance between piecewise smooth curves
- Fréchet Distance for Curves, Revisited
- Fast Fréchet distance between curves with long edges
Analysis of algorithms (68W40) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cited In (29)
- Title not available (Why is that?)
- Approximating the Fréchet distance for realistic curves in near linear time
- The prefix Fréchet similarity
- Approximating the integral Fréchet distance
- Tighter connections between Formula-SAT and shaving logs
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
- A discrete framework to find the optimal matching between manifold-valued curves
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Fast Fréchet queries
- Improved algorithms for partial curve matching
- A reparameterisation based approach to geodesic constrained solvers for curve matching
- Similarity of polygonal curves in the presence of outliers
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
- On length-sensitive Fréchet similarity
- Title not available (Why is that?)
- Approximate Map Matching with respect to the Fréchet Distance
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- Following a curve with the discrete Fréchet distance
- Approximately matching polygonal curves with respect to the Fréchet distance
- Discretely following a curve
- Coastline matching via a graph-based approach
- Improved algorithms for partial curve matching
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- Finding long and similar parts of trajectories
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- Integrated shape-sensitive functional metrics
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
- More flexible curve matching via the partial Fréchet similarity
- Title not available (Why is that?)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4633876)