Consider $f:[0,2\pi) \to [0,2\pi )$ given by $f(x) = (x + 1) \bmod 2\pi$ for all $x\in [0,2\pi )$, i.e. a shift map on the unit circle with anti-clockwise shift of $1$. Denote the sequence $\{ x_n \}$ for which $x_0=0$ and $x_n$ satisfies the recurrence relation $x_{n} = f(x_{n-1})$ for each $n\in\mathbb{N}$. Moreover, denote $$ Y_N = \bigcup_{i=0}^N (x_i-\delta , x_i+\delta ) \quad \forall N\in\mathbb{N} .$$ From Jacobi's theorem (see Devaney - An introduction to chaotic dynamical systems) it follows that $\{ x_n \}$ is dense in $[0, 2\pi)$. Thus for each $\delta >0$ there exists a smallest value $N_\delta\in\mathbb{N}$ such that $[0,1]\subset Y_{N_\delta}$.
$\textbf{Question}$ Is there a reference for (or an explanation of) an estimate for $N_\delta$ as $\delta \to 0$ and if so, what is this estimate? If an estimate isn't readily available, information concerning nontrivial upper or lower bounds on $N_\delta$ as $\delta \to 0$ would be appreciated.