Recommendations
- Combinatorial View of Digital Convexity
- First steps in the algorithmic reconstruction of digital convex sets
- Interactions between digital geometry and combinatorics on words
- Detection of the discrete convexity of polyominoes
- An arithmetical characterization of the convex hull of digital straight segments
Cites work
- scientific article; zbMATH DE number 417855 (Why is no real title available?)
- scientific article; zbMATH DE number 3848644 (Why is no real title available?)
- scientific article; zbMATH DE number 46318 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- scientific article; zbMATH DE number 2084493 (Why is no real title available?)
- scientific article; zbMATH DE number 1737190 (Why is no real title available?)
- scientific article; zbMATH DE number 2183071 (Why is no real title available?)
- scientific article; zbMATH DE number 1436417 (Why is no real title available?)
- A Combinatorial Lemma and Its Application to Probability Theory
- Algorithms on Strings
- An Optimal Algorithm for Detecting Pseudo-squares
- An output sensitive algorithm for discrete convex hulls
- Certain words on the real projective line
- Combinatorial View of Digital Convexity
- Combinatorics on Words
- Detection of the discrete convexity of polyominoes
- Digital Convexity, Straightness, and Convex Polygons
- Digital Straight Lines and Convexity of Digital Regions
- Digital straightness -- a review
- Discrete images, objects, and functions in \(Z^ n\)
- Factorizing words over an ordered alphabet
- Free Lie algebras and free monoids. Bases of free Lie algebras and factorizations of free monoids
- Lyndon words, permutations and trees.
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- On the tiling by translation problem
- On-line construction of the convex hull of a simple polyline
- PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- Salient and Reentrant Points of Discrete Sets
- Sturmian words, Lyndon words and trees
- Words over an ordered alphabet and suffix permutations
Cited in
(35)- Detection of the discrete convexity of polyominoes
- Equations on palindromes and circular words
- Geometric preservation of 2D digital objects under rigid motions
- Efficient operations on discrete paths
- Interactions between digital geometry and combinatorics on words
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words
- Minimal non-convex words
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
- Algorithms for pixelwise shape deformations preserving digital convexity
- Extended suffix array construction using Lyndon factors
- Inferring strings from Lyndon factorization
- Further steps on the reconstruction of convex polyominoes from orthogonal projections
- Efficient Algorithms to Test Digital Convexity
- Arithmetic Discrete Planes Are Quasicrystals
- Efficiently testing digital convexity and recognizing digital convex polygons
- Properties of SAT formulas characterizing convex sets with given projections
- On generalized Lyndon words
- Euclidean farthest-point Voronoi diagram of a digital edge
- Lyndon factorization of grammar compressed texts revisited
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels
- Faithful polygonal representation of the convex and concave parts of a digital curve
- Two linear-time algorithms for computing the minimum length polygon of a digital contour
- First steps in the algorithmic reconstruction of digital convex sets
- Combinatorial View of Digital Convexity
- About thin arithmetic discrete planes
- Studies on finite Sturmian words
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- The ``runs theorem
- scientific article; zbMATH DE number 2079750 (Why is no real title available?)
- Continued fractions with \(\mathrm{SL}(2, \mathbb{Z})\)-branches: combinatorics and entropy
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text
- A linear time and space algorithm for detecting path intersection
- Generic Algorithms for Factoring Strings
- An alternative definition for digital convexity
- An alternative definition for digital convexity
This page was built for publication: Lyndon + Christoffel = digitally convex
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q834259)
