Convexity preserving deformations of digital sets: characterization of removable and insertable pixels

DOI10.1016/j.dam.2023.08.016OpenAlexW4390657800MaRDI QIDQ6069173

Jean-Pierre Borel, Lama Tarsissi, Pascal Romon, Yukiko Kenmochi, David Coeurjolly

Publication date: 13 November 2023

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://hal.science/hal-03712662

zbMATH Keywords

Christoffel wordsLyndon wordsdigital convexitydigital set deflationdigital set inflation

Mathematics Subject Classification ID

Combinatorics on words (68R15) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Variants of convex sets (star-shaped, ((m, n))-convex, etc.) (52A30)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lyndon + Christoffel = digitally convex
• Lyndon words and singular factors of sturmian words
• Certain words on the real projective line
• \(\alpha\)-words and factors of characteristic sequences
• Sturmian words, Lyndon words and trees
• First steps in the algorithmic reconstruction of digital convex sets
• Detection of the discrete convexity of polyominoes
• Further steps on the reconstruction of convex polyominoes from orthogonal projections
• Faithful polygonal representation of the convex and concave parts of a digital curve
• Factorizing words over an ordered alphabet
• Combinatorics on Words
• Digital Straight Lines and Convexity of Digital Regions
• Fast parallel Lyndon factorization with applications
• Connectivity in Digital Pictures
• The Boundary Count of Digital Pictures
• Identities in Finite Algebras

This page was built for publication: Convexity preserving deformations of digital sets: characterization of removable and insertable pixels