Combinatorial View of Digital Convexity

DOI10.1007/978-3-540-79126-3_7zbMATH Open1138.68585OpenAlexW1793744123MaRDI QIDQ5458874FDOQ5458874

Authors 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

Lyndon wordsChristoffel wordsDigital Convexity

Mathematics Subject Classification ID

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

Recommendations

• Lyndon + Christoffel = digitally convex
• 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
• scientific article; zbMATH DE number 2084493

Cites work

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

Cited in

(16)

• Lyndon + Christoffel = digitally convex
• Efficiently testing digital convexity and recognizing digital convex polygons
• Algorithms for pixelwise shape deformations preserving digital convexity
• Asymptotic analysis and random sampling of digitally convex polyominoes
• Convexity preserving deformations of digital sets: characterization of removable and insertable pixels
• Minimal non-convex words
• An alternative definition for digital convexity
• An alternative definition for digital convexity
• scientific article; zbMATH DE number 2079750 (Why is no real title available?)
• Interactions between digital geometry and combinatorics on words
• A linear time and space algorithm for detecting path intersection in \(\mathbb Z^d\)
• First steps in the algorithmic reconstruction of digital convex sets
• scientific article; zbMATH DE number 2084493 (Why is no real title available?)
• Detection of the discrete convexity of polyominoes
• A linear time and space algorithm for detecting path intersection
• Efficient Algorithms to Test Digital Convexity

This page was built for publication: Combinatorial View of Digital Convexity

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5458874)