An optimal algorithm for finding minimal enclosing triangles
Journal of Algorithms
Optimum Uniform Piecewise Linear Approximation of Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
On the Detection of Dominant Points on Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
An adaptive dominant point detection algorithm for digital curves
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Notes on searching in multidimensional monotone arrays
SFCS '88 Proceedings of the 29th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
In this work, we present an optimal solution to the following problem: given a Freeman chain-code curve with n elements, and m points of it, find the minimum envelope of the curve by a set of line segments. This segments are obtained modifying the coordinates of these m points up to a distance h. The complexity of this algorithm is O(nh+mh2), and it needs a storage of O(mh) data. In addition, we propose a greedy approximation algorithm that provides good results with lower complexity O(nh) in the worst case, and memory requirements O(h). A pre-processing with O(mn) is also needed for both algorithms. Some experimental results are shown.