Pages that link to "Item:Q818650"
From MaRDI portal
The following pages link to Near-linear time approximation algorithms for curve simplification (Q818650):
Displaying 12 items.
- Approximating the Fréchet distance for realistic curves in near linear time (Q443909) (← links)
- Embedding ray intersection graphs and global curve simplification (Q2151460) (← links)
- Computing homotopic line simplification (Q2249045) (← links)
- Progressive simplification of polygonal curves (Q2306367) (← links)
- Four Soviets walk the dog: improved bounds for computing the Fréchet distance (Q2408191) (← links)
- On the Hardness of Orthogonal-Order Preserving Graph Drawing (Q3611858) (← links)
- VORONOI DIAGRAM OF POLYGONAL CHAINS UNDER THE DISCRETE FRÉCHET DISTANCE (Q4931733) (← links)
- Global Curve Simplification (Q5075813) (← links)
- (Q5088945) (← links)
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
- Place the Vertices Anywhere on the Curve and Simplify (Q5164876) (← links)
- (Q5881551) (← links)
