Generating convex polyominoes at random
FPSAC '93 Proceedings of the 5th conference on Formal power series and algebraic combinatorics
Reconstructing convex polyominoes from horizontal and vertical projections
Theoretical Computer Science
The number of convex polyominoes reconstructible from their orthogonal projections
Proceedings of the 6th conference on Formal power series and algebraic combinatorics
Reconstructing hv-convex polyominoes from orthogonal projections
Information Processing Letters
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
Combinatorial view of digital convexity
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
A linear time and space algorithm for detecting path intersection
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
A linear time and space algorithm for detecting path intersection in Zd
Theoretical Computer Science
A linear algorithm for polygonal representations of digital sets
IWCIA'06 Proceedings of the 11th international conference on Combinatorial Image Analysis
| Hi-index | 0.05 |
The convexity of a discrete region is a property used in numerous domains of computational imagery. We study its detection in the particular case of polyominoes. We present a first method, directly relying on its definition. A second method, which is based on techniques for segmentation of curves in discrete lines, leads to a very simple, linear, algorithm whose correctness is proven. Correlatively, we obtain a characterisation of lower and upper frontiers of the convex hull of a discrete line segment. Finally, we evoke some applications of these results to the problem of discrete tomography.