A linear algorithm for polygonal approximations of thick curves

Authors:
Trung Nguyen
Affiliations:
Ecole Normale Superieure, Paris, France
Venue:
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Year:
2005

Citing 5
Cited 0

On-line construction of the convex hull of a simple polyline

Information Processing Letters
Computing the Width of a Set

IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimum polygonal approximation of digitized curves

Pattern Recognition Letters
An efficient algorithm for the optimal polygonal approximation of digitized curves

Pattern Recognition Letters
Reduced-search dynamic programming for approximation of polygonal curves

Pattern Recognition Letters

Quantified Score

Hi-index	0.00

Visualization

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.