12 search results - page 1 / 3 » Fast Polynomial Segmentation of Digitized Curves |
DGCI
2006
Springer
13 years 7 months ago
2006
Springer
We propose a linear-time algorithm for curve segmentation which is based on constructive polynomial fitting. This work extends previous work on constructive fitting by taking the t...
DGCI
1997
Springer
13 years 9 months ago
1997
Springer
A new classification of digital curves into boundary curves and visual curves of different thickness is suggested. A fast algorithm for recognizing digital straight line segments i...
MVA
1994
13 years 6 months ago
1994
A new algorithm, based on area-deviation, is proposed for the detection of corner points of digitized curves. The algorithm consists of two steps. In the first step, a fixed-lengt...
ICIP
2009
IEEE
14 years 6 months ago
2009
IEEE
A new and fast method for dominant point detection and polygonal representation of a discrete curve is proposed. Starting from results of discrete geometry [1, 2], the notion of m...
ICPR
2008
IEEE
13 years 11 months ago
2008
IEEE
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...