Christoffel word

Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
We address the problem of computing the exact characteristics of any subsegment of a Digital Straight Line (DSL) with known …
Jacques-Olivier Lachaud, M. Said
PDF Cite Project Project DOI Code (DGtal) URL
Two efficient algorithms for computing the characteristics of a subsegment of a digital straight line
Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time
We address the problem of computing the exact characteristics of any subsegment of a digital straight line with known characteristics. …
M. Said, Jacques-Olivier Lachaud
PDF Cite Project Code (DGtal)
Computing the Characteristics of a SubSegment of a Digital Straight Line in Logarithmic Time
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
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