ABSTRACT
In this chapter we propose a two-pass sequential algorithm for polygonal approximation of digital planar curve. Unlike other sequential algorithms that use conventional perpendicular distance as a metric, this chapter uses distance to a point. The approximations produced are perceptually pleasing, do not round off sharp turnings, do not miss corners and are symmetrical for symmetrical input curve. This chapter also introduces a new metric to measure and compare the fidelity of an approximation with another and use this measure to compare the proposed algorithm with a recent one and show improvement over the same.
