  In this book chapter, written in French, we consider the classical family of
Sturmian words, defined as the aperiodic infinite words containing only $n+1$
factors of a length $n$, which is the minimal possible value. We will discuss
several techniques for Sturmian words which have not been described in
monographs. In particular, we will consider the geometric dual method by
Berstel and Pocchiola and the link between palindrome factors and Ostrowski
numeration systems. We will also discuss a conjecture on palindromic length
which was proved on Sturmian words by two completely different methods for two
distinct cases.
