COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
From MaRDI portal
(Redirected from Publication:4698353)
Recommendations
Cited in
(only showing first 100 items - show all)- Improved algorithms for distance selection and related problems
- Measuring similarity between curves on 2-manifolds via homotopy area
- Median trajectories
- Risk-optimal path planning in stochastic dynamic environments
- Computing a subtrajectory cluster from c-packed trajectories
- scientific article; zbMATH DE number 7559218 (Why is no real title available?)
- Realizability of free spaces of curves
- scientific article; zbMATH DE number 2079389 (Why is no real title available?)
- Semantic spaces
- An effective and versatile distance measure for spatiotemporal trajectories
- The Computational Geometry of Comparing Shapes
- Global Curve Simplification
- The minimum moving spanning tree problem
- The prefix Fréchet similarity
- Path Counting for Grid-Based Navigation
- Revisiting the Fréchet distance between piecewise smooth curves
- Geodesic Fréchet distance inside a simple polygon
- Stochastic time-optimal path-planning in uncertain, strong, and dynamic flows
- Approximating the integral Fréchet distance
- Efficient Fréchet distance queries for segments
- Faster approximate covering of subcurves under the Fréchet distance
- Approximating the packedness of polygonal curves
- Minimization of the maximum distance between the two guards patrolling a polygonal region
- Computing the minimum distance between two Bézier curves
- 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
- Geodesic Fréchet distance inside a simple polygon
- Shape Matching by Random Sampling
- Computing the Fréchet distance between simple polygons
- Can we compute the similarity between surfaces?
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- (1+)-ANN data structure for curves via subspaces of bounded doubling dimension
- Map matching queries on realistic input graphs under the Fréchet distance
- On computing the k-shortcut Fréchet distance
- Fast Fréchet queries
- Fast algorithms for approximate Fréchet matching queries in geometric trees
- The VC dimension of metric balls under Fréchet and Hausdorff distances
- Streaming algorithms for line simplification
- The Minimum Moving Spanning Tree Problem
- On the Chain Pair Simplification Problem
- Improved algorithms for partial curve matching
- A middle curve based on discrete Fréchet distance
- Coresets for \((k, \ell ) \)-median clustering under the Fréchet distance
- Probabilistic embeddings of the Fréchet distance
- A sequential algorithm for recognition of a developing pattern with application in orthotic engineering
- Voronoi diagram of polygonal chains under the discrete Fréchet distance
- scientific article; zbMATH DE number 7561345 (Why is no real title available?)
- Approximating the -low-density value
- Computing the Fréchet Gap Distance
- Translation invariant Fréchet distance queries
- Link Distance and Shortest Path Problems in the Plane
- Realizability of free spaces of curves
- Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes
- Approximating ( k,ℓ )-Median Clustering for Polygonal Curves
- Fréchet Distance for Uncertain Curves
- Shape matching by random sampling
- Similarity of polygonal curves in the presence of outliers
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
- Fréchet Distance for Curves, Revisited
- Computing the \(k\)-visibility region of a point in a polygon
- Measuring similarity between curves on 2-manifolds via homotopy area
- scientific article; zbMATH DE number 1689042 (Why is no real title available?)
- Voronoi Diagram of Polygonal Chains under the Discrete Fréchet Distance
- On length-sensitive Fréchet similarity
- scientific article; zbMATH DE number 176499 (Why is no real title available?)
- Fast Fréchet distance between curves with long edges
- Fréchet view -- a tool for exploring Fréchet distance algorithms (multimedia exposition)
- Go with the flow: the direction-based Fréchet distance of polygonal curves
- Fréchet distance between a line and avatar point set
- Shortest Path Problems on a Polyhedral Surface
- Approximating the Fréchet distance for realistic curves in near linear time
- Progressive simplification of polygonal curves
- Chasing puppies: mobile beacon routing on closed curves
- Translating Hausdorff is hard: fine-grained lower bounds for Hausdorff distance under translation
- Approximating the (continuous) Fréchet distance
- Computing the Fréchet distance between uncertain curves in one dimension
- Discovering the dynamics of Sargassum rafts' centers of mass
- On Computing the Fréchet Distance Between Surfaces.
- Recognizing the similarity of polygons in a strengthened Hausdorff metric
- On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions
- Shortest path problems on a polyhedral surface
- Fréchet distance for uncertain curves
- How to walk your dog in the mountains with no magic leash
- Optimal grids for five-axis machining
- Following a curve with the discrete Fréchet distance
- Approximately matching polygonal curves with respect to the Fréchet distance
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds
- Floating tangents for approximating spatial curves with \(G^1\) piecewise helices
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Enhanced trajectory data visualization: a dynamic time warping integrated t-SNE approach with real-data applications
- Physics-informed machine learning for wetting hydrodynamics
- Fréchet distance between two point sets
- Distance measures for embedded graphs
- Fréchet similarity of closed polygonal curves
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- Computing the Fréchet distance between uncertain curves in one dimension
- A faster algorithm for the Fréchet distance in 1D for the imbalanced case
- Discretely following a curve
- Computing the discrete Fréchet distance with imprecise input
- Link distance and shortest path problems in the plane
This page was built for publication: COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4698353)
