Pages that link to "Item:Q834259"
From MaRDI portal
The following pages link to Lyndon + Christoffel = digitally convex (Q834259):
Displaying 28 items.
- Efficient operations on discrete paths (Q265059) (← links)
- Faster Lyndon factorization algorithms for SLP and LZ78 compressed text (Q507399) (← links)
- Equations on palindromes and circular words (Q544873) (← links)
- Minimal non-convex words (Q544886) (← links)
- About thin arithmetic discrete planes (Q638550) (← links)
- A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) (Q638566) (← links)
- Two linear-time algorithms for computing the minimum length polygon of a digital contour (Q765322) (← links)
- Extended suffix array construction using Lyndon factors (Q1615410) (← links)
- Geometric preservation of 2D digital objects under rigid motions (Q1722617) (← links)
- Further steps on the reconstruction of convex polyominoes from orthogonal projections (Q2084620) (← links)
- Efficiently testing digital convexity and recognizing digital convex polygons (Q2203347) (← links)
- Discrete segments of \(\mathbb{Z}^3\) constructed by synchronization of words (Q2255823) (← links)
- Euclidean farthest-point Voronoi diagram of a digital edge (Q2255824) (← links)
- Faithful polygonal representation of the convex and concave parts of a digital curve (Q2276012) (← links)
- Studies on finite Sturmian words (Q2354408) (← links)
- Inferring strings from Lyndon factorization (Q2402270) (← links)
- On generalized Lyndon words (Q2422029) (← links)
- Arithmetic Discrete Planes Are Quasicrystals (Q3648766) (← links)
- Two Linear-Time Algorithms for Computing the Minimum Length Polygon of a Digital Contour (Q3648777) (← links)
- A Linear Time and Space Algorithm for Detecting Path Intersection (Q3648803) (← links)
- Continued fractions with $SL(2, Z)$-branches: combinatorics and entropy (Q4635484) (← links)
- Generic Algorithms for Factoring Strings (Q4915247) (← links)
- Lyndon factorization of grammar compressed texts revisited (Q5140789) (← links)
- Efficient Algorithms to Test Digital Convexity (Q5237086) (← links)
- The “Runs” Theorem (Q5359492) (← links)
- An alternative definition for digital convexity (Q5918416) (← links)
- An alternative definition for digital convexity (Q5925581) (← links)
- Convexity preserving deformations of digital sets: characterization of removable and insertable pixels (Q6069173) (← links)
