Abstract
The concept of fuzzy segment was introduced in [2]. In this paper we suggest a notion of strict fuzzy segment and provide a linear algorithm for recognizing it thanks to a simple property of convex hull. A linear method to decompose a thick curve into strict fuzzy segments is also given. The quality of decomposition can be easily controlled by setting two threshold values: the maximum order and the minimum density of the fuzzy segments. The algorithm is fast, practical and multi-purpose.
This work is partially supported by the Geometrica project, INRIA Sophia Antipolis, France. Any opinions, findings, or conclusions expressed in this paper are those of the author and do not necessarily reflect the views of the Geometrica.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Debled-Rennesson, I., Reveillès, J.-P.: A linear algorithm for segmentation of digital curves. International Journal of Pattern Recognition and Artificial Intelligence 9, 635–662 (1995)
Debled-Rennesson, I., Remy, J.-L., Rouyer, J.: Segmentation of discrete curves into fuzzy segments. Electronic Notes in Discrete Mathematics 12 (2003)
Houle, M.E., Toussaint, G.T.: Computing the width of a set. IEEE Transactions on Pattern Analysis and Machine Intelligence 10(5), 761–765 (1988)
Kolesnikov, A., Fränti, P.: Reduced-search dynamic programming for approximation of polygonal curves. Pattern Recognition Letters 24(14), 2243–2254 (2003)
Melkman, A.: On-line construction of the convex hull of a simple polyline. Information Processing Letters 25, 11–12 (1987)
Perez, J.-C., Vidal, E.: Optimum polygonal approximation of digitized curves. Pattern Recognition Letters 15, 743–750 (1994)
Reveillès, J.-P.: Géométrie discrète, calcul en nombres entiers et algorithmique, Thèse d’Etat. Université Louis Pasteur, Strasbourg (1991)
Salotti, M.: An efficient algorithm for the optimal polygonal approximation of digitized curves. Pattern Recognition Letters 22, 215–221 (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Nguyen, T. (2005). A Linear Algorithm for Polygonal Approximations of Thick Curves. In: Gagalowicz, A., Philips, W. (eds) Computer Analysis of Images and Patterns. CAIP 2005. Lecture Notes in Computer Science, vol 3691. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11556121_3
Download citation
DOI: https://doi.org/10.1007/11556121_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-28969-2
Online ISBN: 978-3-540-32011-1
eBook Packages: Computer ScienceComputer Science (R0)