Pages that link to "Item:Q443909"
From MaRDI portal
The following pages link to Approximating the Fréchet distance for realistic curves in near linear time (Q443909):
Displaying 29 items.
- Computing the Fréchet distance with a retractable leash (Q312142) (← links)
- Bounding and estimating the Hausdorff distance between real space algebraic curves (Q396191) (← links)
- Computing the Fréchet distance between folded polygons (Q904083) (← links)
- Computing the similarity between moving curves (Q1615772) (← links)
- Probabilistic embeddings of the Fréchet distance (Q1757772) (← links)
- Computing the Fréchet gap distance (Q2022625) (← links)
- Approximating the packedness of polygonal curves (Q2088893) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- Computing homotopic line simplification (Q2249045) (← links)
- Fast algorithms for approximate Fréchet matching queries in geometric trees (Q2349741) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance (Q3000715) (← 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)
- (Q4633876) (← links)
- Tighter connections between Formula-SAT and shaving logs (Q5002674) (← links)
- Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance (Q5088944) (← links)
- Fast Fréchet Distance Between Curves with Long Edges (Q5197493) (← links)
- SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension (Q5236371) (← 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)
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation (Q5874493) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5896889) (← links)
- Computing the Fréchet distance between uncertain curves in one dimension (Q5918556) (← links)
- How to walk your dog in the mountains with no magic leash (Q5964220) (← links)
- Approximating the Packedness of Polygonal Curves (Q6065398) (← links)
- On approximate near-neighbors search under the (continuous) Fréchet distance in higher dimensions (Q6072195) (← links)
- Approximating the \(\lambda \)-low-density value (Q6591458) (← links)
