The following pages link to (Q3813185):
Displaying 18 items.
- Polygonal chain approximation: A query based approach (Q706723) (← links)
- Compressing spatio-temporal trajectories (Q833705) (← links)
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- Approximation of an open polygonal curve with a minimum number of circular arcs and biarcs (Q934021) (← links)
- Continuous location of dimensional structures. (Q1410321) (← links)
- On the Farey sequence and its augmentation for applications to image analysis (Q1676209) (← links)
- Efficient algorithms for 3-D polygonal approximation based on LISE criterion (Q1860236) (← links)
- Efficient piecewise-linear function approximation using the uniform metric (Q1906048) (← links)
- Computing homotopic line simplification (Q2249045) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- (Q5088945) (← links)
- On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance (Q5115824) (← links)
- Compressing Spatio-temporal Trajectories (Q5387810) (← links)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)
- Weighted Rectilinear Approximation of Points in the Plane (Q5458566) (← links)
- Fitting rectilinear polgonal curves to a set of points in the plane. (Q5932036) (← links)
