Name
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, Provencal 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. |
Year | Venue | Field |
|---|---|---|
2017 | WORDS | Discrete geometry,Discrete mathematics,Convexity,Computer science,Polyomino,Regular polygon,Euclidean geometry,Digital geometry,Monotone polygon,Combinatorics on words |
DocType | Citations | PageRank |
Conference | 0 | 0.34 |
References | Authors | |
3 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Paolo Dulio | 1 | 31 | 12.39 |
| Andrea Frosini | 2 | 101 | 20.44 |
| S. Rinaldi | 3 | 0 | 1.35 |
| Lama Tarsissi | 4 | 0 | 0.34 |
| Laurent Vuillon | 5 | 186 | 26.63 |