Lyndon + Christoffel = digitally convex
From MaRDI portal
Publication:834259
DOI10.1016/J.PATCOG.2008.11.010zbMATH Open1176.68175OpenAlexW2133546939WikidataQ56030653 ScholiaQ56030653MaRDI QIDQ834259FDOQ834259
Authors: Srečko Brlek, Jacques-Olivier Lachaud, Xavier Provençal, Christophe Reutenauer 
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
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
Pattern recognition, speech recognition (68T10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Combinatorics on words (68R15)
Cites Work
- Necklaces of beads in k colors and k-ary de Bruijn sequences
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Certain words on the real projective line
- Sturmian words, Lyndon words and trees
- Digital straightness -- a review
- A Combinatorial Lemma and Its Application to Probability Theory
- Factorizing words over an ordered alphabet
- Title not available (Why is that?)
- Discrete images, objects, and functions in \(Z^ n\)
- Combinatorics on Words
- Title not available (Why is that?)
- Algorithms on Strings
- On the tiling by translation problem
- Free Lie algebras and free monoids. Bases of free Lie algebras and factorizations of free monoids
- Salient and Reentrant Points of Discrete Sets
- Title not available (Why is that?)
- PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
- Lyndon words, permutations and trees.
- Words over an ordered alphabet and suffix permutations
- Detection of the discrete convexity of polyominoes
- Title not available (Why is that?)
- Title not available (Why is that?)
- An Optimal Algorithm for Detecting Pseudo-squares
- Combinatorial View of Digital Convexity
- Digital Convexity, Straightness, and Convex Polygons
- On-line construction of the convex hull of a simple polyline
- An output sensitive algorithm for discrete convex hulls
- Quasi-Monotonic Sequences: Theory, Algorithms and Applications
- Digital Straight Lines and Convexity of Digital Regions
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
- Interactions between digital geometry and combinatorics on words
- Efficient operations on discrete paths
- 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
- Properties of SAT formulas characterizing convex sets with given projections
- Efficiently testing digital convexity and recognizing digital convex polygons
- On generalized Lyndon words
- Lyndon factorization of grammar compressed texts revisited
- Euclidean farthest-point Voronoi diagram of a digital edge
- 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
- The ``runs theorem
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour
- Title not available (Why is that?)
- 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)
