Pages that link to "Item:Q5396948"
From MaRDI portal
The following pages link to Jaywalking Your Dog: Computing the Fréchet Distance with Shortcuts (Q5396948):
Displaying 21 items.
- Computing the Fréchet distance between folded polygons (Q904083) (← links)
- Universal approximate simplification under the discrete Fréchet distance (Q1705647) (← links)
- Fast Fréchet queries (Q1947991) (← links)
- Computing the Fréchet gap distance (Q2022625) (← links)
- Approximating the packedness of polygonal curves (Q2088893) (← 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)
- Translation invariant Fréchet distance queries (Q2665912) (← links)
- Approximate nearest neighbor for curves: simple, efficient, and deterministic (Q2701391) (← links)
- On the Chain Pair Simplification Problem (Q3449833) (← links)
- (Q5002674) (← links)
- Global Curve Simplification (Q5075813) (← links)
- (Q5116484) (← links)
- Fast Fréchet Distance Between Curves with Long Edges (Q5197493) (← links)
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds (Q5370572) (← links)
- (Q5743403) (← links)
- Approximating ( <i>k,ℓ</i> )-Median Clustering for Polygonal Curves (Q6051930) (← links)
- Fréchet Distance for Uncertain Curves (Q6051994) (← 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)
- Shortcut hulls: vertex-restricted outer simplifications of polygons (Q6103172) (← links)