A natural metric for curves -- computing the distance for polygonal chains and approximation algorithms
From MaRDI portal
Recommendations
Cited in
(31)- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- A fast algorithm for approximating the detour of a polygonal chain.
- Universal approximate simplification under the discrete Fréchet distance
- Approximate matching of polygonal shapes
- Embedding ray intersection graphs and global curve simplification
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Efficient observer-dependent simplification in polygonal domains
- Adaptive dissimilarity index for measuring time series proximity
- scientific article; zbMATH DE number 5942297 (Why is no real title available?)
- Approximation algorithms for geometrical distance problems that are not solvable exactly
- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
- A fast algorithm for approximating the detour of a polygonal chain
- Tighter connections between Formula-SAT and shaving logs
- Global Curve Simplification
- Polyline simplification has cubic complexity
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- Algorithms and Computation
- A new metric between polygons, and how to compute it
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- Streaming algorithms for line simplification
- Fréchet Distance for Uncertain Curves
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Fréchet distance for uncertain curves
- Minimum-complexity graph simplification under the Fréchet-like distance
- Faster Fréchet distance approximation through truncated smoothing
- Map-matching queries under Fréchet distance on low-density spanners
- Efficient Fréchet distance queries for segments
- Closest univariate convex linear-quadratic function approximation with minimal number of pieces
- Polygonal chain approximation: A query based approach
- Simplification of trajectory streams
This page was built for publication: A natural metric for curves -- computing the distance for polygonal chains and approximation algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4035663)
