Pages that link to "Item:Q5405902"
From MaRDI portal
The following pages link to Approximating the Fréchet distance for realistic curves in near linear time (Q5405902):
Displaying 15 items.
- Bounding and estimating the Hausdorff distance between real space algebraic curves (Q396191) (← links)
- Approximating the Fréchet distance for realistic curves in near linear time (Q443909) (← links)
- Universal approximate simplification under the discrete Fréchet distance (Q1705647) (← links)
- Fast Fréchet queries (Q1947991) (← links)
- Approximating the packedness of polygonal curves (Q2088893) (← links)
- Fast algorithms for approximate Fréchet matching queries in geometric trees (Q2349741) (← links)
- A Near-Linear Time Guaranteed Algorithm for Digital Curve Simplification under the Fréchet Distance (Q3000715) (← links)
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds (Q3459889) (← links)
- (Q4633876) (← 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)
- The frechet distance revisited and extended (Q5404460) (← links)
- (Q5743403) (← links)
- (Q6124766) (← links)