CumInCAD is a Cumulative Index about publications in Computer Aided Architectural Design
supported by the sibling associations ACADIA, CAADRIA, eCAADe, SIGraDi, ASCAAD and CAAD futures

authors Ramer, Urs
year 1972
title An Iterative Procedure for the Polygonal Approximation of Plane Curves
source Computer Graphics and Image Processing. Academic Press Inc., August, 1972. vol. 1: pp. 244- 256 : ill. ; diagrams. includes bibliography
summary The approximation of arbitrary two-dimensional curves by polygons is an important technique in image processing. For many applications, the apparent ideal procedure is to represent lines and boundaries by means of polygons with minimum number of vertices and satisfying a given fit criterion. In this paper, an approximation algorithm is presented which uses an iterative method to produce polygons with a small-but not minimum-number of vertices that lie on the given curve. The maximum distance of the curve from the approximating polygon is chosen as the fit criterion. The results obtained justify the abandonment of the minimum- vertices criterion which is computationally much more expensive
keywords curves, polygons, image processing, approximation, algorithms
series CADline
references Content-type: text/plain
last changed 1999/02/12 14:09
HOMELOGIN (you are user _anon_525283 from group guest) Works Powered by SciX Open Publishing Services 1.002