Pages that link to "Item:Q4962190"
From MaRDI portal
The following pages link to The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (Q4962190):
Displaying 10 items.
- Computing the Fréchet gap distance (Q2022625) (← links)
- Rearranging a sequence of points onto a line (Q2144451) (← links)
- Reverse shortest path problem in weighted unit-disk graphs (Q2154091) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Approximability of the discrete Fréchet distance (Q2970465) (← links)
- Computing the Fréchet distance with shortcuts is NP-hard (Q4635561) (← links)
- The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (Q4635562) (← 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)
- When Lipschitz Walks Your Dog: Algorithm Engineering of the Discrete Fréchet Distance under Translation (Q5874493) (← links)
