On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Straight Line Segments
IEEE Transactions on Computers
Algorithm for computer control of a digital plotter
IBM Systems Journal
A Generic and Parallel Algorithm for 2D Image Discrete Contour Reconstruction
ISVC '08 Proceedings of the 4th International Symposium on Advances in Visual Computing, Part II
What Does Digital Straightness Tell about Digital Convexity?
IWCIA '09 Proceedings of the 13th 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
Scaling of plane figures that assures faithful digitization
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Robust decomposition of thick digital shapes
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Minimal decomposition of a digital surface into digital plane segments is NP-Hard
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
Two-Dimensional discrete shape matching and recognition
IWCIA'06 Proceedings of the 11th international conference 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 generic 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.