Pages that link to "Item:Q4635562"
From MaRDI portal
The following pages link to The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (Q4635562):
Displaying 10 items.
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- Approximability of the discrete Fréchet distance (Q2970465) (← links)
- On the Chain Pair Simplification Problem (Q3449833) (← links)
- Locality-sensitive hashing of curves (Q4580112) (← links)
- Computing the Fréchet distance with shortcuts is NP-hard (Q4635561) (← links)
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (Q4962190) (← links)
- (Q5116484) (← links)
- Algorithms for the discrete Fréchet distance under translation (Q5120149) (← links)
- SETH Says: Weak Fréchet Distance is Faster, but only if it is Continuous and in One Dimension (Q5236371) (← links)
- Adaptive computation of the discrete Fréchet distance (Q6109733) (← links)