The Envelope of a Digital Curve Based on Dominant Points
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+mh 2), 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.
KeywordsTangency Point Greedy Heuristic Error Area Dominant Point Digital Curve
- 1.A. Aggarwal, J. Park: Notes on Searching in Multidimensional Monotone Arrays. Proc. 29th IEEE Symp. on Found. of Comp. Sci. (1988), 497–512 453Google Scholar
- 4.A. DePano, A. Aggarwal: Finding restricted k-envelopes for convex polygons. Proc. 22nd Allerton Conf. on Comm. Control and Computing, (1984) 81–90 453Google Scholar
- 5.DavidM. Mount, Ruth Silverman: Minimum enclosures with specified angles. Technical Report, CS-TR-3219 (1994) 453Google Scholar
- 11.Isabelle Debled-Rennesson, Jean-Pierre Reveillès: A linear algorithm for segmentation of digital curves. Int. J. of Pattern Recog. and Artificial Intelligence. 9–6 (1995) 454Google Scholar
- 12.David E. Singh, María J. Martín, Francisco F. Rivera: Propiedades geométricas en la obtención de la envolvente a una curva digital. Tech. report. (1999) 456, 457, 460, 461Google Scholar