A Theory of Multiscale, Curvature-Based Shape Representation for Planar Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
Convexity rule for shape decomposition based on discrete contour evolution
Computer Vision and Image Understanding
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
Digital lines and digital convexity
Digital and image geometry
Detection of the discrete convexity of polyominoes
Discrete Applied Mathematics
Digital straightness and convexity (Extended Abstract)
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
Polygonal Representations of Digital Sets
Algorithmica
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Canonical representations of discrete curves
Pattern Analysis & Applications
Fast, accurate and convergent tangent estimation on digital contours
Image and Vision Computing
Lyndon + Christoffel = digitally convex
Pattern Recognition
What Does Digital Straightness Tell about Digital Convexity?
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Multi-scale Analysis of Discrete Contours for Unsupervised Noise Detection
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
Two linear-time algorithms for computing the minimum length polygon of a digital contour
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Digital deformable model simulating active contours
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Maximum Likelihood Estimation of Markov-Process Blob Boundaries in Noisy Images
IEEE Transactions on Pattern Analysis and Machine Intelligence
Digital Straight Lines and Convexity of Digital Regions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Revisiting digital straight segment recognition
DGCI'06 Proceedings of the 13th international conference on Discrete Geometry for Computer Imagery
A linear algorithm for polygonal representations of digital sets
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
Digital Convexity, Straightness, and Convex Polygons
IEEE Transactions on Pattern Analysis and Machine Intelligence
Recursive computation of minimum-length polygons
Computer Vision and Image Understanding
| Hi-index | 0.01 |
From results about digital convexity, we define a reversible polygon that faithfully represents the maximal convex and concave parts of a digital curve. Such a polygon always exists and is unique in the general case. It is computed from a given digital curve in linear-time using well-known routines: adding a point at the front of a digital straight segment and removing a point from the back of a digital straight segment. It may helps to extract perceptually meaningful parts of shape outlines or lines.