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. © Springer-Verlag Berlin Heidelberg 2005.
Cite
CITATION STYLE
Nguyen, T. (2005). A linear algorithm for polygonal approximations of thick curves. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3691 LNCS, pp. 17–25). https://doi.org/10.1007/11556121_3
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
