On-line construction of the convex hull of a simple polyline
Information Processing Letters
Techniques for Assessing Polygonal Approximations of Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Segmentation of planar curves into straight-line segments and elliptical arcs
Graphical Models and Image Processing
Fast Decomposition of Digital Curves into Polygons Using the Haar Transform
IEEE Transactions on Pattern Analysis and Machine Intelligence
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Geometrical parameters extraction from discrete paths
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
| Hi-index | 0.00 |
The concept of blurred segment is introduced, it allows the flexible segmentation of discrete curves, taking into account noise. Relying on an arithmetic definition of discrete lines [J.-P. Reveillès, Géométrie discrète, calculs en nombre entiers et algorithmique, Thèse d'état, Université Louis Pasteur, Strasbourg, 1991], it generalizes such lines, admitting that some points are missing. Thus, a larger class of objects is considered. A very efficient linear detection algorithm for blurred segments and its application to curve segmentation are presented.