Lyndon + Christoffel = digitally convex
type: Item
instance of: scholarly article
title: Lyndon + Christoffel = digitally convex
zbMATH Open document ID: 1176.68175
published in: Pattern Recognition
publication date: 2009-08-19T00:00:00Z
full work available at URL: Reutenauer-2009a-preprint.pdf
Mathematics Subject Classification ID: 68T10
Mathematics Subject Classification ID: 68U05
Mathematics Subject Classification ID: 68R15
zbMATH DE Number: 5596859
zbMATH Keywords: digital convexity
zbMATH Keywords: Lyndon words
zbMATH Keywords: Christoffel words
zbMATH Keywords: convex hull
author: Srečko Brlek
author: Jacques-Olivier Lachaud
author: Xavier Provençal
author: Christophe Reutenauer
MaRDI profile type: Publication
OpenAlex ID: W2133546939
Wikidata QID: Q56030653
cites work: Q3996586
cites work: Digital Convexity, Straightness, and Convex Polygons
cites work: Digital Straight Lines and Convexity of Digital Regions
cites work: Digital straightness -- a review
cites work: Q4475319
cites work: Detection of the discrete convexity of polyominoes
cites work: Q3318142
cites work: Discrete images, objects, and functions in \(Z^ n\)
cites work: An output sensitive algorithm for discrete convex hulls
cites work: Q4341774
cites work: Q4529547
cites work: Q4681771
cites work: PROPERTIES OF THE CONTOUR PATH OF DISCRETE SETS
cites work: Salient and Reentrant Points of Discrete Sets
cites work: An Optimal Algorithm for Detecting Pseudo-squares
cites work: On the tiling by translation problem
cites work: Necklaces of beads in k colors and k-ary de Bruijn sequences
cites work: Factorizing words over an ordered alphabet
cites work: On-line construction of the convex hull of a simple polyline
cites work: Combinatorial View of Digital Convexity
cites work: Q3134850
cites work: Algorithms on Strings
cites work: Words over an ordered alphabet and suffix permutations
cites work: Lyndon words, permutations and trees.
cites work: Combinatorics on Words
cites work: Certain words on the real projective line
cites work: Sturmian words, Lyndon words and trees
cites work: Q4948843
cites work: A Combinatorial Lemma and Its Application to Probability Theory
cites work: Free Lie algebras and free monoids. Bases of free Lie algebras and factorizations of free monoids
cites work: Quasi-Monotonic Sequences: Theory, Algorithms and Applications
DOI: 10.1016/J.PATCOG.2008.11.010
description: scientific article; zbMATH DE number 5596859