An O(N) algorithm for polygonal approximation

Authors:
L.P Cordella;G Dettori
Affiliations:
Dipartimento di Informatica e Sistemistica, Università di Napoli, Napoli, Italy;Instituto per la Matematica Applicata del C.N.R., Genova, Italy
Venue:
Pattern Recognition Letters
Year:
1985

Citing 5
Cited 3

The Use of Algorithms of Piecewise Approximations for Picture Processing Applications

ACM Transactions on Mathematical Software (TOMS)
Computer Vision

Computer Vision
Computational geometry.

Computational geometry.
Segmentation of Plane Curves

IEEE Transactions on Computers
Minimum-Perimeter Polygons of Digitized Silhouettes

IEEE Transactions on Computers

Visual form processing

Journal of Visual Languages and Computing
Polygonal path simplification with angle constraints

Computational Geometry: Theory and Applications
Extremal point queries with lines and line segments and related problems

Computational Geometry: Theory and Applications

Quantified Score

Hi-index	0.10

Visualization

Abstract

A new, sequential algorithm for polygonal approximation of plane, closed curves is presented. It runs in O(N) time and is based on a tolerance independent of the scale factor.