The following pages link to (Q4035663):
Displaying 15 items.
- Universal approximate simplification under the discrete Fréchet distance (Q1705647) (← links)
- Approximate matching of polygonal shapes (Q1924770) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- Efficient observer-dependent simplification in polygonal domains (Q2428687) (← links)
- Adaptive dissimilarity index for measuring time series proximity (Q2477570) (← links)
- (Q5002674) (← links)
- Global Curve Simplification (Q5075813) (← links)
- (Q5088945) (← links)
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
- Improved Approximation for Fréchet Distance on c-Packed Curves Matching Conditional Lower Bounds (Q5370572) (← links)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)
- Streaming algorithms for line simplification (Q5919922) (← links)
- Fréchet Distance for Uncertain Curves (Q6051994) (← links)
- Graphs cannot be indexed in polynomial time for sub-quadratic time string matching, unless SETH fails (Q6076352) (← links)