Pages that link to "Item:Q1653046"
From MaRDI portal
The following pages link to An improved approximation algorithm for the discrete Fréchet distance (Q1653046):
Displaying 18 items.
- Approximating the integral Fréchet distance (Q1615637) (← links)
- Fine-grained complexity theory: conditional lower bounds for computational geometry (Q2117766) (← links)
- Approximating the geometric edit distance (Q2165024) (← links)
- Approximability of the discrete Fréchet distance (Q2970465) (← links)
- Improved Approximation for Fréchet Distance on c-packed Curves Matching Conditional Lower Bounds (Q3459889) (← links)
- (Q4386961) (← links)
- The Discrete Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (Q4635562) (← links)
- Improved Distance Queries and Cycle Counting by Frobenius Normal Form (Q4636657) (← links)
- The Discrete and Semicontinuous Fréchet Distance with Shortcuts via Approximate Distance Counting and Selection (Q4962190) (← links)
- (Q5111282) (← links)
- (Q5116484) (← links)
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds (Q5370572) (← links)
- An efficient algorithm for computing free distance (Corresp.) (Q5641068) (← links)
- Comments on "An efficient algorithm for computing free distance" by Bahl, L., et al. (Q5678749) (← links)
- Adaptive computation of the discrete Fréchet distance (Q6109733) (← links)
- (Q6124766) (← links)
- A comparison of distance metrics for the multi-objective pathfinding problem (Q6535739) (← links)
- Local trajectory variation exponent (LTVE) for visualizing dynamical systems (Q6670116) (← links)