Polygonal approximation of closed discrete curves
Authors:
- Alexander KolesnikovAKAlexander Kolesnikov
- Pasi FräntiPFPasi Fränti
- 1 April 2007
- journal article
- Published by Elsevier in Pattern Recognition
- Vol. 40 (4) , 1282-1293
Abstract
No abstract availableKeywords
This publication has 37 references indexed in Scilit:
- An efficient algorithm for the optimal polygonal approximation of digitized curvesPattern Recognition Letters, 2001
- Space-Efficient Algorithms for Approximating Polygonal Curves in Two Dimensional Space1998
- APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERRORInternational Journal of Computational Geometry & Applications, 1996
- Optimal polygonal approximation of digital curvesPattern Recognition, 1995
- Optimum polygonal approximation of digitized curvesPattern Recognition Letters, 1994
- Computational-geometric methods for polygonal approximations of a curveComputer Vision, Graphics, and Image Processing, 1986
- Optimum Uniform Piecewise Linear Approximation of Planar CurvesIEEE Transactions on Pattern Analysis and Machine Intelligence, 1986
- Optimal polygonal approximation of digital curvesSignal Processing, 1985
- ALGORITHMS FOR THE REDUCTION OF THE NUMBER OF POINTS REQUIRED TO REPRESENT A DIGITIZED LINE OR ITS CARICATURECartographica, 1973
- An iterative procedure for the polygonal approximation of plane curvesComputer Graphics and Image Processing, 1972