Optimum uniform piecewise linear approximation of planar curves
Related Experiment Video
Updated: May 29, 2026

Convergent Polishing: A Simple, Rapid, Full Aperture Polishing Process of High Quality Optical Flats & Spheres
Published on: December 1, 2014
1Department of Electrical Engineering, Southern Methodist University, Dallas, TX 75275.
Abstract:
Two-dimensional digital curves are often uniformly approximated by polygons or piecewise linear curves. Several algorithms have been proposed in the literature to find such curves. We present an algorithm that finds a piecewise linear curve with the minimal number of segments required to approximate a curve within a uniform error with fixed initial and final points. We compare our optimal algorithm to several suboptimal algorithms with respect to the number of linear segments required in the approximation and the execution time of the algorithm.
Related Concept Videos
Linearization and Approximation
Application of Linearization and Approximation
Piecewise-Defined Functions
Linear Approximation in Time Domain
For a simple pendulum with a mass evenly distributed along its length and the center of mass located at half the pendulum's length, the...
Curvilinear Motion: Rectangular Components
As the car advances, its position evolves over time. Quantifying the car's velocity involves computing the time...
Linear Approximation in Frequency Domain
In contrast, nonlinear systems do not inherently possess these properties. However, for small deviations around an operating point, a nonlinear system can often be approximated as linear.
