Lyndon + Christoffel = digitally convex
From MaRDI portal
Publication:834259
DOI10.1016/j.patcog.2008.11.010zbMath1176.68175WikidataQ56030653 ScholiaQ56030653MaRDI QIDQ834259
Srečko Brlek, Jacques-Olivier Lachaud, Christophe Reutenauer, Xavier Provençal
Publication date: 19 August 2009
Published in: Pattern Recognition (Search for Journal in Brave)
Full work available at URL: http://www.archipel.uqam.ca/8354/1/Reutenauer-2009a-preprint.pdf
68R15: Combinatorics on words
68T10: Pattern recognition, speech recognition
68U05: Computer graphics; computational geometry (digital and algorithmic aspects)
Related Items
Continued fractions with $SL(2, Z)$-branches: combinatorics and entropy, Generic Algorithms for Factoring Strings, Efficient Algorithms to Test Digital Convexity, Lyndon factorization of grammar compressed texts revisited, The “Runs” Theorem, An alternative definition for digital convexity, An alternative definition for digital convexity, Convexity preserving deformations of digital sets: characterization of removable and insertable pixels, Algorithms for pixelwise shape deformations preserving digital convexity, Properties of SAT formulas characterizing convex sets with given projections, Efficient operations on discrete paths, Faster Lyndon factorization algorithms for SLP and LZ78 compressed text, Equations on palindromes and circular words, Minimal non-convex words, About thin arithmetic discrete planes, A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\), Two linear-time algorithms for computing the minimum length polygon of a digital contour, Extended suffix array construction using Lyndon factors, Geometric preservation of 2D digital objects under rigid motions, Further steps on the reconstruction of convex polyominoes from orthogonal projections, Efficiently testing digital convexity and recognizing digital convex polygons, Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words, Euclidean farthest-point Voronoi diagram of a digital edge, Faithful polygonal representation of the convex and concave parts of a digital curve, Studies on finite Sturmian words, Inferring strings from Lyndon factorization, On generalized Lyndon words, Arithmetic Discrete Planes Are Quasicrystals, Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour, A Linear Time and Space Algorithm for Detecting Path Intersection
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Discrete images, objects, and functions in \(Z^ n\)
- On the tiling by translation problem
- On-line construction of the convex hull of a simple polyline
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Free Lie algebras and free monoids. Bases of free Lie algebras and factorizations of free monoids
- Certain words on the real projective line
- An output sensitive algorithm for discrete convex hulls
- Sturmian words, Lyndon words and trees
- Lyndon words, permutations and trees.
- Digital straightness -- a review
- Detection of the discrete convexity of polyominoes
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- A Combinatorial Lemma and Its Application to Probability Theory
- Factorizing words over an ordered alphabet
- Salient and Reentrant Points of Discrete Sets
- Combinatorics on Words
- Digital Straight Lines and Convexity of Digital Regions
- Digital Convexity, Straightness, and Convex Polygons
- Words over an ordered alphabet and suffix permutations
- An Optimal Algorithm for Detecting Pseudo-squares
- Algorithms on Strings
- Combinatorial View of Digital Convexity
- PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
