Pages that link to "Item:Q5449516"
From MaRDI portal
The following pages link to Fréchet Distance for Curves, Revisited (Q5449516):
Displaying 18 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)
- Fréchet distance between a line and avatar point set (Q722543) (← 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)
- Fast Fréchet queries (Q1947991) (← 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)
- 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)
- Computing the Fréchet Distance Between Polygons with Holes (Q3448855) (← links)
- (Q5002674) (← links)
- Fast Fréchet Distance Between Curves with Long Edges (Q5197493) (← 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)
