On-line construction of the convex hull of a simple polyline
Information Processing Letters
Digital Geometry: Geometric Methods for Digital Picture Analysis
Digital Geometry: Geometric Methods for Digital Picture Analysis
Canonical representations of discrete curves
Pattern Analysis & Applications
Fast, accurate and convergent tangent estimation on digital contours
Image and Vision Computing
ICIAP '07 Proceedings of the 14th International Conference on Image Analysis and Processing
On the min DSS problem of closed discrete curves
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Curvature estimation in noisy curves
CAIP'07 Proceedings of the 12th international conference on Computer analysis of images and patterns
Optimal blurred segments decomposition in linear time
DGCI'05 Proceedings of the 12th 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
Fast Polygonal Approximation of Digital Curves Using Relaxed Straightness Properties
IEEE Transactions on Pattern Analysis and Machine Intelligence
Tangential cover for thick digital curves
Pattern Recognition
Robust decomposition of thick digital shapes
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
A discrete geometry approach for dominant point detection
Pattern Recognition
| Hi-index | 0.00 |
The recognition of digital shapes is a deeply studied problem. The arithmetical framework, initiated by J.P. Reveillès in [1], provides a great theoretical basis, as well as many algorithms to deal with discrete objects. Among the many available tools, the tangential cover is a powerful one. First presented in [2], it computes the set of all maximal segments of a digital curve and allows either to obtain minimal length polygonalization, or asymptotic convergence of tangent estimations. Nevertheless, the arithmetical approach does not tolerate the introduction of irregularities, which are however inherent to the acquisition of digital shapes. In this paper, we propose a new definition for a class of so-called "thick digital curves" that applies well to a large class of discrete objects boundaries. We then propose an extension of the tangential cover to thick digital curves and provide an algorithm with a O(n log n) complexity, where n is the number of points of specific subparts of the thick digital curve.