Abstract
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 [4]) 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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Barcucci, E., Del Lungo, A., Nivat, M., Pinzani, R.: Reconstructing convex polyominoes from horizontal and vertical projections. Theoret. Comput. Sci. 155(2), 321–347 (1996). http://dx.doi.org/10.1016/0304-3975(94)00293–2
Bernoulli, J.: Sur une nouvelle espèce de calcul, pp. 255–284. Recueil pour les astronomes
Borel, J.P., Laubie, F.: Quelques mots sur la droite projective réelle. J. Théor. Nombres Bordeaux 5(1), 23–51 (1993). http://jtnb.cedram.org/item?id=JTNB_1993_5_1_23_0
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
Chaudhuri, B.B., Rosenfeld, A.: On the computation of the digital convex hull and circular hull of a digital region. Pattern Recogn. 31(12), 2007–2016 (1998)
Chen, K.T., Fox, R.H., Lyndon, R.C.: Free differential calculus, IV: the quotient groups of the lower central series. Ann. Math. 68(2), 81–95 (1958). http://dx.doi.org/10.2307/1970044
Christoffel, E.: Observatio arithmetica. Annali di Matematica 6, 145–152 (1875)
Debled-Rennesson, I., Jean-Luc, R., Rouyer-Degli, J.: Detection of the discrete convexity of polyominoes. In: Borgefors, G., Nyström, I., Baja, G.S. (eds.) DGCI 2000. LNCS, vol. 1953, pp. 491–504. Springer, Heidelberg (2000). doi:10.1007/3-540-44438-6_40
Sklansky, J.: Recognition of convex blobs. Pattern Recogn. 2(1), 3–10 (1970)
Acknowledgment
This study has been partially supported by INDAM - GNCS Project 2017.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Dulio, P., Frosini, A., Rinaldi, S., Tarsissi, L., Vuillon, L. (2017). First Steps in the Algorithmic Reconstruction of Digital Convex Sets. In: Brlek, S., Dolce, F., Reutenauer, C., Vandomme, É. (eds) Combinatorics on Words. WORDS 2017. Lecture Notes in Computer Science(), vol 10432. Springer, Cham. https://doi.org/10.1007/978-3-319-66396-8_16
Download citation
DOI: https://doi.org/10.1007/978-3-319-66396-8_16
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-66395-1
Online ISBN: 978-3-319-66396-8
eBook Packages: Computer ScienceComputer Science (R0)