Pages that link to "Item:Q5449516"

The following pages link to Fréchet Distance for Curves, Revisited (Q5449516):

Displaying 37 items.

• Approximating the Fréchet distance for realistic curves in near linear time (Q443909) (← links)
• Shortest path problems on a polyhedral surface (Q472466) (← links)
• Link distance and shortest path problems in the plane (Q634253) (← links)
• Approximately matching polygonal curves with respect to the Fréchet distance (Q705548) (← links)
• Fréchet distance between a line and avatar point set (Q722543) (← links)
• Computing the Fréchet distance between piecewise smooth curves (Q883235) (← links)
• Homotopic Fréchet distance between curves or, walking your dog in the woods in polynomial time (Q1037652) (← links)
• Computing the similarity between moving curves (Q1615772) (← links)
• Locally correct Fréchet matchings (Q1624582) (← links)
• Universal approximate simplification under the discrete Fréchet distance (Q1705647) (← links)
• Probabilistic embeddings of the Fréchet distance (Q1757772) (← links)
• Fast Fréchet queries (Q1947991) (← links)
• Computing the Fréchet gap distance (Q2022625) (← links)
• Integrated shape-sensitive functional metrics (Q2078545) (← links)
• Approximating the packedness of polygonal curves (Q2088893) (← links)
• A comprehensive study of clustering a class of 2D shapes (Q2140983) (← links)
• Middle curves based on discrete Fréchet distance (Q2206718) (← links)
• Distinct distances on curves via rigidity (Q2249479) (← links)
• Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
• A sequential algorithm for recognition of a developing pattern with application in orthotic engineering (Q2459564) (← links)
• Chord-to-point distance accumulation and planar curvature: A new approach to discrete curvature (Q2748189) (← links)
• Recursive Computation of the Fréchet Mean on Non-positively Curved Riemannian Manifolds with Applications (Q2807040) (← links)
• Fréchet similarity of closed polygonal curves (Q2809314) (← links)
• Computing the Fréchet Distance Between Polygons with Holes (Q3448855) (← links)
• Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds (Q3459889) (← links)
• Sampling-based bottleneck pathfinding with applications to Fréchet matching (Q4606351) (← links)
• (Q4633876) (← links)
• COMPUTING THE FRÉCHET DISTANCE BETWEEN TWO POLYGONAL CURVES (Q4698353) (← links)
• (Q4901851) (← links)
• Tighter connections between Formula-SAT and shaving logs (Q5002674) (← links)
• Fast Fréchet Distance Between Curves with Long Edges (Q5197493) (← links)
• Approximating the Integral Fréchet Distance (Q5369528) (← links)
• Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds (Q5370572) (← links)
• Approximating the Fréchet distance for realistic curves in near linear time (Q5405902) (← links)
• Approximating the Packedness of Polygonal Curves (Q6065398) (← links)
• Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)
• (Q6124766) (← links)