word combinatorics

Asymptotic linear digital geometry
Invited talk.
Feb 8, 2011 12:00 AM — 12:00 AM Paris, France
Jacques-Olivier Lachaud
Project Slides (PDF)
Asymptotic linear digital geometry
Asymptotic linear digital geometry and applications
Invited talk.
Feb 8, 2011 12:00 AM — 12:00 AM Perpignan, France
Jacques-Olivier Lachaud
Project Slides (PDF)
Asymptotic linear digital geometry and applications
Dynamic Minimum Length Polygon
This paper presents a formal framework for representing all reversible polygonalizations of a digital contour (i.e. the boundary of a …
Jacques-Olivier Lachaud, X. Provençal
PDF Cite Project Slides (PDF)
Dynamic Minimum Length Polygon
Two linear-time algorithms for computing the minimum length polygon of a digital contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the …
Jacques-Olivier Lachaud, X. Provençal
PDF Cite Project
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Lyndon + Christoffel = digitally convex
Discrete geometry redefines notions borrowed from Euclidean geometry creating a need for new algorithmical tools. The notion of …
S. Brlek, Jacques-Olivier Lachaud, X. Provençal, C. Reutenauer
PDF Cite DOI URL HAL
Lyndon + Christoffel = digitally convex
Two linear-time algorithms for computing the minimum length polygon of a digital contour
The Minimum Length Polygon (MLP) is an interesting first order approximation of a digital contour. For instance, the convexity of the …
X. Provençal, Jacques-Olivier Lachaud
PDF Cite Project URL
Two linear-time algorithms for computing the minimum length polygon of a digital contour
Combinatorial view of digital convexity
The notion of convexity translates non-trivially from Euclidean geometry to discrete geometry, and detecting if a discrete region of …
S. Brlek, Jacques-Olivier Lachaud, X. Provençal
PDF Cite
Combinatorial view of digital convexity