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
Detection of the discrete convexity of polyominoes
Discrete Applied Mathematics
Polygonal Representations of Digital Sets
Algorithmica
What Does Digital Straightness Tell about Digital Convexity?
IWCIA '09 Proceedings of the 13th International Workshop on Combinatorial Image Analysis
A linear time and space algorithm for detecting path intersection in Zd
Theoretical Computer Science
| Hi-index | 0.00 |
Polygonal representations of digital sets with the same convexity properties allow a simple decomposition of digital boundaries into convex and concave parts. Representations whose vertices are boundary points, i.e. are integer numbers, attract most attention. The existing linear Algorithm UpPolRep computes polygonal representations with some uncorresponding parts. However, the algorithm is unable to decide if a corresponding polygonal representation still exists and in the case of existence it is unable to compute the representation. Studying situations where uncorrespondences appear we extended the algorithm. The extention does not change the time complexity. If a digital set possesses a corresponding representation then it detects this representation. Otherwise, it recognizes that such representation does not exist.