Computational geometry: an introduction
Computational geometry: an introduction
On-line construction of the convex hull of a simple polyline
Information Processing Letters
IEEE Transactions on Pattern Analysis and Machine Intelligence
Optimum polygonal approximation of digitized curves
Pattern Recognition Letters
Techniques for Assessing Polygonal Approximations of Curves
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
Optimal Time Computation of the Tangent of a Discrete Curve: Application to the Curvature
DCGI '99 Proceedings of the 8th International Conference on Discrete Geometry for Computer Imagery
Reduced-search dynamic programming for approximation of polygonal curves
Pattern Recognition Letters
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Tangential cover for thick digital curves
Pattern Recognition
Optimal blurred segments decomposition of noisy shapes in linear time
Computers and Graphics
Tangential cover for thick digital curves
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Robust decomposition of thick digital shapes
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Dynamic reconstruction of complex planar objects on irregular isothetic grids
ISVC'06 Proceedings of the Second international conference on Advances in Visual Computing - Volume Part II
Fast guaranteed polygonal approximations of closed digital curves
SCIA'05 Proceedings of the 14th Scandinavian conference on Image Analysis
Topological and geometrical reconstruction of complex objects on irregular isothetic grids
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Digital line recognition, convex hull, thickness, a unified and logarithmic technique
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
| Hi-index | 0.00 |
Blurred (previously named fuzzy) segments were introduced by Debled-Rennesson et al [1,2] as an extension of the arithmetical approach of Reveillès [11] on discrete lines, to take into account noise in digital images. An incremental linear-time algorithm was presented to decompose a discrete curve into blurred segments with order bounded by a parameter d. However, that algorithm fails to segment discrete curves into a minimal number of blurred segments. We show in this paper, that this characteristic is intrinsic to the whole class of blurred segments. We thus introduce a subclass of blurred segments, based on a geometric measure of thickness. We provide a new convex hull based incremental linear time algorithm for segmenting discrete curves into a minimal number of thin blurred segments.