SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE

DOI10.1142/S0218195903001086zbMath1152.68660MaRDI QIDQ4818576

Ovidiu Daescu, Danny Z. Chen

Publication date: 29 September 2004

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

approximationlinear spacecomputational geometrypolygonal curve

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (13)

SIMPLIPOLY: CURVATURE-BASED POLYGONAL CURVE SIMPLIFICATION ⋮ Area-preserving approximations of polygonal paths ⋮ Distance-preserving approximations of polygonal paths ⋮ Representing a functional curve by curves with fewer peaks ⋮ Optimal simplification of polygonal chains for subpixel-accurate rendering ⋮ Place the Vertices Anywhere on the Curve and Simplify ⋮ Data reduction of large vector graphics ⋮ Farthest-point queries with geometric and combinatorial constraints ⋮ Polygonal chain approximation: A query based approach ⋮ Simplifying 3D Polygonal Chains Under the Discrete Fréchet Distance ⋮ Polygonal path simplification with angle constraints ⋮ Extremal point queries with lines and line segments and related problems ⋮ Hausdorff approximation of convex polygons

Cites Work

• Polygonal approximation by the minimax method
• APPROXIMATING POLYGONS AND SUBDIVISIONS WITH MINIMUM-LINK PATHS
• Segmentation of Plane Curves
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR

This page was built for publication: SPACE-EFFICIENT ALGORITHMS FOR APPROXIMATING POLYGONAL CURVES IN TWO-DIMENSIONAL SPACE