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
On the min DSS problem of closed discrete curves
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Tangential cover for thick digital curves
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
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
On the digital tangent bundle and some extensions
ACC'08 Proceedings of the WSEAS International Conference on Applied Computing Conference
Tangential cover for thick digital curves
Pattern Recognition
Multi-primitive Analysis of Digital Curves
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
| Hi-index | 0.00 |
This paper deals with the widely studied problem of decomposition of digital shapes. The Tangential Cover [7] is a powerful tool that computes the set of all maximal segments of a digital curve. In previous works [4], the Tangential Cover has been extended to a new class of "thick digital curves". This extension brought up some major issues. In the present paper, we generalize even more the notion of Tangential Cover, in order to fix those issues. We propose a new relevant way of representing thick digital curves, as sets of consecutive triangles. Then, we study the use of this representation to define a generalized Tangential Cover, and we show some results produced by our technique.