Abstract
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.
This work was supported by the Xunta de Galicia grant PGIDT99PXI20602B
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
A. Aggarwal, J. Park: Notes on Searching in Multidimensional Monotone Arrays. Proc. 29th IEEE Symp. on Found. of Comp. Sci. (1988), 497–512 453
J. O’Rourke, A. Aggarwal, S. Maddial, M. Baldwin: An optimal algorithm for finding enclosing triangles. J. Algorithms, 7 (1986) 258–269 453
A. Aggarwal, J. Chang, C. Yap: Minimum Area Circumscribing Polygons. Visual Computer, 1 (1985), 112–117 453
A. DePano, A. Aggarwal: Finding restricted k-envelopes for convex polygons. Proc. 22nd Allerton Conf. on Comm. Control and Computing, (1984) 81–90 453
DavidM. Mount, Ruth Silverman: Minimum enclosures with specified angles. Technical Report, CS-TR-3219 (1994) 453
J. G. Dunham: Optimum Uniform Piecewise Linear Approximation of Planar Curves. IEEE Trans. Pattern Anal. and Machine Intelligence, V. 8–1, (1986) 67–75 453
Paul L. Rosin: Techniques for Assessing polygonal approximations of curves. IEEE Trans. on Pattern Anal. and Machine Intelligence, Vol 19, No 6 (1997) 659–666 453
F. Attneave: Some informational aspects of visual perception. Psychol. Review. vol 61, no 3, (1954) 183–193 454
Mohan S. Kankanhalli: An adaptive dominant point detection algorithm for digital curves. Pattern Recognition Letters. 14 (1993) 385–390 454
Cho-Huak Teh, Roland T. Chin: On the detection of dominant points. IEEE Trans. on Pattern Anal. and Machine Intelligence. Vol 11. No 8 (1989) 859–872 454
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) 454
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, 461
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Singh, D.E., Martín, M.J., Rivera, F.F. (2000). The Envelope of a Digital Curve Based on Dominant Points. In: Borgefors, G., Nyström, I., di Baja, G.S. (eds) Discrete Geometry for Computer Imagery. DGCI 2000. Lecture Notes in Computer Science, vol 1953. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-44438-6_37
Download citation
DOI: https://doi.org/10.1007/3-540-44438-6_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-41396-7
Online ISBN: 978-3-540-44438-1
eBook Packages: Springer Book Archive
