First Steps in the Algorithmic Reconstruction of Digital Convex Sets
Digital convex (DC) sets plays a prominent role in the framework of digital geometry providing a natural generalization to the concept of Euclidean convexity when we are dealing with polyominoes, i.e., finite and connected sets of points. A result by Brlek, Lachaud, Provençal and Reutenauer (see ) on this topic sets a bridge between digital convexity and combinatorics on words: the boundary word of a DC polyomino can be divided in four monotone paths, each of them having a Lyndon factorization that contains only Christoffel words.
The intent of this paper is to provide some local properties that a boundary words has to fulfill in order to allow a single point modifications that preserves the convexity of the polyomino.
KeywordsDigital convexity Discrete geometry Discrete tomography Reconstruction problem
This study has been partially supported by INDAM - GNCS Project 2017.
- 2.Bernoulli, J.: Sur une nouvelle espèce de calcul, pp. 255–284. Recueil pour les astronomesGoogle Scholar
- 4.Brlek, S., Lachaud, J.O., ProvenÃSS, X., Reutenauer, C.: Lyndon+christoffel = digitally convex. Pattern Recogn. 42(10), 2239–2246 (2009). Selected papers from the 14th IAPR International Conference on Discrete Geometry for Computer Imagery 2008, http://www.sciencedirect.com/science/article/pii/S0031320308004706 CrossRefzbMATHGoogle Scholar