On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Journal of Mathematical Imaging and Vision
Fast, accurate and convergent tangent estimation on digital contours
Image and Vision Computing
Minimum decomposition of a digital surface into digital plane segments is NP-hard
Discrete Applied Mathematics
Digitization scheme that assures faithful reconstruction of plane figures
Pattern Recognition
Tangential cover for thick digital curves
Pattern Recognition
Some theoretical challenges in digital geometry: A perspective
Discrete Applied Mathematics
Multi-primitive Analysis of Digital Curves
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Hi-index | 0.00 |
Given a discrete eight-connected curve, it can be represented by discrete eight connected segments. In this paper, we try to determine the minimal number of necessary discrete segments. This problem is known as the min DSS problem. We propose to use a genetic curve representation by discrete tangents, called a tangential cover which can be computed in linear time. We introduce a series of criteria each having a linear-time complexity to progressively solve the min DSS problem. This results in an optimal algorithm both from the point of view of optimization and of complexity, outperforming the previous quadratic bound.