Journal ArticleDOI
An efficient algorithm for the piecewise linear approximation of planar curves
Reads0
Chats0
TLDR
In this article, a simple, highly efficient, and computationally stable algorithm is developed for the approximation of arbitrary planar curves by linear segments, which yields excellent results in economizing the number of line vectors required to represent curves on display within precisions specified by an error tolerance parameter.About:
This article is published in Computer Graphics and Image Processing.The article was published on 1978-10-01. It has received 124 citations till now. The article focuses on the topics: Approximation error & Family of curves.read more
Citations
More filters
Journal ArticleDOI
A fast sequential method for polygonal approximation of digitized curves
Karin Wall,Per-Erik Danielsson +1 more
TL;DR: In this article, a scan-along algorithm for polygonal approximation is presented, where the approximation depends on the area deviation for each line segment and the algorithm outputs a new line segment when the area variance per length unit of the current segment exceeds a prespecified value.
Journal ArticleDOI
Optimum Uniform Piecewise Linear Approximation of Planar Curves
TL;DR: This work presents an algorithm that finds a piecewise linear curve with the minimal number of segments required to approximate a curve within a uniform error with fixed initial and final points.
Journal ArticleDOI
Threshold selection based on a simple image statistic
TL;DR: A novel method based on image statistics which can be computed without histogramming the grey level values of the image is proposed, which is shown to be effective on a number of practical examples.
Journal ArticleDOI
Techniques for assessing polygonal approximations of curves
TL;DR: A measure which combines the relative fidelity and efficiency of a curve segmentation is described, and this measure is used to compare the application of 23 algorithms to a curve first used by Teh and Chin (1989).
Book ChapterDOI
Polygonal Approximations of a Curve — Formulations and Algorithms
Hiroshi Imai,Masao Iri +1 more
TL;DR: A general framework for polygonal approximation problems in various situations is given, and solution algorithms are discussed, and computationally efficient algorithms are constructed by taking advantage of fundamental algorithms for convex hulls in computational geometry.
References
More filters
Journal ArticleDOI
A note on minimal length polygonal approximation to a digitized contour
TL;DR: A method for extracting a smooth polygonal contour from a digitized image and the determination of the minimal polygon can be reduced to a nonlinear programming problem, solved by an algorithm which takes into account the weak bonds between variables.
Journal ArticleDOI
Approximation of curves by line segments
TL;DR: In this article, it was shown that the points at which one line segment was discontinued and the next line segment started were equally spaced over the interval in the case of quadratic functions.
Journal ArticleDOI
Optimal Curve Fitting With Piecewise Linear Functions
TL;DR: A method is described for determining an optimal straight-line segment approximation to specified functions for constrained and unconstrained endpoints.
Journal ArticleDOI
On the Quantization of Line-Drawing Data
Herbert Freeman,Jeremy M. Glass +1 more
TL;DR: A criterion for the quantization of line-drawing data is developed based on viewing a line drawing as an elastic beam under flexure and selecting a quantization grid size that is fine enough to permit the line drawing to be represented by a beam of minimum strain energy.
Journal ArticleDOI
A line segment curve-fitting algorithm related to optimal encoding of information*
TL;DR: A computational algorithm is determined for solving the problem of storing N + 1 line segments joining the successive points and it is shown how the points are determined when the uj and Yj are constrained, for example, to integer values.