A new technique for polygonal approximation is proposed. It is fast and simple. The vertices of the polygon are identified by considering the patterns exhibited by the first-order finite differences of boundary point data. The error of approximation in constructing the polygon is found to be within a certain bound. © 1991.