Approximating the Fréchet distance for realistic curves in near linear time
From MaRDI portal
(Redirected from Publication:443909)
Recommendations
Cites work
- A decomposition of multidimensional point sets with applications to k -nearest-neighbors and n -body potential fields
- A note on the perimeter of fat objects
- Approximating the Fréchet distance for realistic curves in near linear time
- COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
- Comparison of distance measures for planar curves
- Detecting Commuting Patterns by Clustering Subtrajectories
- Fréchet Distance for Curves, Revisited
- Improved bounds on the union complexity of fat objects
- Linear size binary space partitions for uncluttered scenes
- Near-linear time approximation algorithms for curve simplification
- On Approximating the Depth and Related Problems
- Realistic input models for geometric algorithms
- The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
- The Computational Geometry of Comparing Shapes
Cited in
(31)- A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance
- Bounding and estimating the Hausdorff distance between real space algebraic curves
- Approximating the Fréchet distance for realistic curves in near linear time
- Approximating the packedness of polygonal curves
- Approximating the integral Fréchet distance
- Tighter connections between Formula-SAT and shaving logs
- Fréchet queries in geometric trees
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
- Fine-grained complexity theory: conditional lower bounds for computational geometry
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- \((1+\varepsilon)\)-ANN data structure for curves via subspaces of bounded doubling dimension
- Fast algorithms for approximate Fréchet matching queries in geometric trees
- Probabilistic embeddings of the Fréchet distance
- Approximating the \(\lambda \)-low-density value
- Computing homotopic line simplification
- Fréchet Distance for Uncertain Curves
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
- Fast Fréchet distance between curves with long edges
- Computing the Fréchet distance between uncertain curves in one dimension
- On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
- How to walk your dog in the mountains with no magic leash
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- Computing the Fréchet distance between uncertain curves in one dimension
- Computing the Fréchet distance with a retractable leash
- Computing the Fréchet gap distance
- scientific article; zbMATH DE number 7051233 (Why is no real title available?)
- Computing the Fréchet distance between folded polygons
- Computing the Fréchet distance between polygons with holes
- SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds
- Approximating the Packedness of Polygonal Curves
This page was built for publication: Approximating the Fréchet distance for realistic curves in near linear time
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q443909)
