COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES
From MaRDI portal
Publication:4698353
Recommendations
Cited in
(only showing first 100 items - show all)- The VC dimension of metric balls under Fréchet and Hausdorff distances
- Computing the Fréchet gap distance
- Computing the Fréchet distance with a retractable leash
- Computing the Fréchet distance with a retractable leash
- Approximating the packedness of polygonal curves
- Shortest path problems on a polyhedral surface
- scientific article; zbMATH DE number 2079389 (Why is no real title available?)
- Sequences of spanning trees and a fixed tree theorem
- scientific article; zbMATH DE number 1189312 (Why is no real title available?)
- The minimum moving spanning tree problem
- scientific article; zbMATH DE number 176499 (Why is no real title available?)
- Curve matching, time warping, and light fields: New algorithms for computing similarity between curves
- Fréchet distance between a line and avatar point set
- Two problems concerning Fréchet distance and lines of evasion
- Fréchet distance problems in weighted regions
- Optimal grids for five-axis machining
- AN APPROXIMATE MORPHING BETWEEN POLYLINES
- Similarity of polygonal curves in the presence of outliers
- Computing the Fréchet Gap Distance
- Detecting commuting patterns by clustering subtrajectories
- Computing the minimum distance between two Bézier curves
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance
- Risk-optimal path planning in stochastic dynamic environments
- Parametric search made practical
- Following a curve with the discrete Fréchet distance
- Computing the Fréchet distance between piecewise smooth curves
- Probabilistic embeddings of the Fréchet distance
- Approximating the Fréchet distance for realistic curves in near linear time
- Shape matching by random sampling
- Geodesic Fréchet distance inside a simple polygon
- scientific article; zbMATH DE number 7559218 (Why is no real title available?)
- Approximating the integral Fréchet distance
- Distance measures for embedded graphs
- Semantic spaces
- Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time
- On Computing the Fréchet Distance Between Surfaces.
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance
- Fréchet Distance for Curves, Revisited
- Gromov-Fréchet distance between curves
- The Computational Geometry of Comparing Shapes
- Computing the Fréchet distance between simple polygons
- Approximately matching polygonal curves with respect to the Fréchet distance
- Fréchet distance with speed limits
- Computing the Fréchet distance between folded polygons
- Folding free-space diagrams: computing the Fréchet distance between 1-dimensional curves
- scientific article; zbMATH DE number 1689042 (Why is no real title available?)
- Link Distance and Shortest Path Problems in the Plane
- Can we compute the similarity between surfaces?
- Geodesic Fréchet distance inside a simple polygon
- An effective and versatile distance measure for spatiotemporal trajectories
- Computing the discrete Fréchet distance with imprecise input
- Shortest Path Problems on a Polyhedral Surface
- Strong path convergence from Loewner driving function convergence
- More flexible curve matching via the partial Fréchet similarity
- Computing the extreme distances between two convex polygons
- On the Chain Pair Simplification Problem
- Floating tangents for approximating spatial curves with \(G^1\) piecewise helices
- Jaywalking your dog: computing the Fréchet distance with shortcuts
- Progressive simplification of polygonal curves
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance
- Link distance and shortest path problems in the plane
- Approximating the Packedness of Polygonal Curves
- scientific article; zbMATH DE number 7662168 (Why is no real title available?)
- Fast Fréchet queries
- Discretely following a curve
- Fast algorithms for approximate Fréchet matching queries in geometric trees
- Shape Matching by Random Sampling
- On optimal polyline simplification using the Hausdorff and Fréchet distance
- Weighted minimum backward Fréchet distance
- Approximating the \(\lambda \)-low-density value
- Measuring similarity between curves on 2-manifolds via homotopy area
- scientific article; zbMATH DE number 7238975 (Why is no real title available?)
- The prefix Fréchet similarity
- Fast Fréchet distance between curves with long edges
- Fréchet similarity of closed polygonal curves
- On flipping the Fréchet distance
- A middle curve based on discrete Fréchet distance
- scientific article; zbMATH DE number 7561345 (Why is no real title available?)
- Voronoi diagram of polygonal chains under the discrete Fréchet distance
- Improved algorithms for partial curve matching
- Fine-grained complexity theory: conditional lower bounds for computational geometry
- How to walk your dog in the mountains with no magic leash
- Stochastic time-optimal path-planning in uncertain, strong, and dynamic flows
- Efficient observer-dependent simplification in polygonal domains
- Fréchet distance between two point sets
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails
- Fréchet view -- a tool for exploring Fréchet distance algorithms (multimedia exposition)
- Measuring similarity between curves on 2-manifolds via homotopy area
- On fully diverse sets of geometric objects and graphs
- The Minimum Moving Spanning Tree Problem
- Global Curve Simplification
- Computing the \(k\)-visibility region of a point in a polygon
- Measuring and improving the geometric accuracy of piece-wise polynomial boundary meshes
- A sequential algorithm for recognition of a developing pattern with application in orthotic engineering
- On length-sensitive Fréchet similarity
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation
- Computing optimal homotopies over a spiked plane with polygonal boundary
- Computing the Fréchet distance between uncertain curves in one dimension
- Improved algorithms for partial curve matching
- Minimization of the maximum distance between the two guards patrolling a polygonal region
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)
