Combinatorial View of Digital Convexity

DOI10.1007/978-3-540-79126-3_7zbMath1138.68585OpenAlexW1793744123MaRDI QIDQ5458874

Srečko Brlek, Xavier Provençal, Jacques-Olivier Lachaud

Publication date: 24 April 2008

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-79126-3_7

zbMATH Keywords

Christoffel wordsLyndon wordsDigital Convexity

Mathematics Subject Classification ID

Computational aspects related to convexity (52B55) Combinatorics on words (68R15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Lyndon + Christoffel = digitally convex ⋮ A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\) ⋮ An alternative definition for digital convexity ⋮ A Linear Time and Space Algorithm for Detecting Path Intersection

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Discrete sets with minimal moment of inertia
• On the tiling by translation problem
• Necklaces of beads in k colors and k-ary de Bruijn sequences
• Certain words on the real projective line
• Sturmian words, Lyndon words and trees
• Algorithms for polyominoes based on the discrete Green theorem
• Digital straightness -- a review
• Detection of the discrete convexity of polyominoes
• Shuffle operations on discrete paths
• Factorizing words over an ordered alphabet
• Digital Straight Lines and Convexity of Digital Regions
• Digital Convexity, Straightness, and Convex Polygons
• An Optimal Algorithm for Detecting Pseudo-squares
• Developments in Language Theory
• PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
• Discrete Geometry for Computer Imagery