论文信息 - Enumeration formula for (2, n)-cubes in discrete planes - 字舞流文

Enumeration formula for (2, n)-cubes in discrete planes

We compute the number of local configurations of size 2xn on naive discrete planes using combinatorics on words, two-dimensional Rote sequences, and Berstel-Pocchiola diagrams.

Laurent Vuillon | Eric Domenjoud | Damien Jamet | Damien Vergnaud

[1] Günter Rote,et al. Sequences With Subword Complexity 2n , 1994 .

[2] Jean-Pierre Reveilles,et al. Combinatorial pieces in digital lines and planes , 1995, Optics & Photonics.

[3] Jean-Marc Chassery,et al. Coexistence of Tricubes in Digital Naive Plane , 1997, DGCI.

[4] Isabelle Debled-Rennesson,et al. Etude et reconnaissance des droites et plans discrets , 1995 .

[5] Mohamed Tajine,et al. About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators , 2008, DGCI.

[6] Laurent Vuillon. Local configurations in a discrete plane , 1999 .

[7] Jean Berstel,et al. A Geometric Proof of the Enumeration Formula for Sturmian Words , 1993, Int. J. Algebra Comput..

[8] C. A. Berenstein,et al. On the Number of Digital Straight Line Segments , 1988, IEEE Trans. Pattern Anal. Mach. Intell..

[9] Mohamed Tajine,et al. About the frequencies of some patterns in digital planes. Application to area estimators , 2009, Comput. Graph..

[10] Yan Gérard. Local Configurations of Digital Hyperplanes , 1999, DGCI.

[11] Filippo Mignosi,et al. On the Number of Factors of Sturmian Words , 1991, Theor. Comput. Sci..

[12] Isabelle Debled-Rennesson,et al. New approach to digital planes , 1995, Other Conferences.