Pages that link to "Item:Q4818576"
From MaRDI portal
The following pages link to SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE (Q4818576):
Displaying 13 items.
- Representing a functional curve by curves with fewer peaks (Q635753) (← links)
- Polygonal chain approximation: A query based approach (Q706723) (← links)
- Area-preserving approximations of polygonal paths (Q866543) (← links)
- Distance-preserving approximations of polygonal paths (Q868106) (← links)
- Optimal simplification of polygonal chains for subpixel-accurate rendering (Q950399) (← links)
- Data reduction of large vector graphics (Q1765582) (← links)
- Farthest-point queries with geometric and combinatorial constraints (Q2489542) (← links)
- Polygonal path simplification with angle constraints (Q2571211) (← links)
- Extremal point queries with lines and line segments and related problems (Q2571215) (← links)
- Hausdorff approximation of convex polygons (Q2573338) (← links)
- SIMPLIPOLY: CURVATURE-BASED POLYGONAL CURVE SIMPLIFICATION (Q2893461) (← links)
- Place the Vertices Anywhere on the Curve and Simplify (Q5164876) (← links)
- Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance (Q5458565) (← links)
