[step:Choose a maximal separated set and identify it as a net]Let $(M,g) \in \mathcal{M}(n,K,D,v)$, and let $d_g: M \times M \to [0,\infty)$ be the Riemannian distance. Choose a maximal finite subset
\begin{align*}
P := \{p_1,\dots,p_N\} \subset M
\end{align*}
such that
\begin{align*}
d_g(p_i,p_j) \ge \varepsilon
\end{align*}
whenever $i \ne j$. Such a set exists because $M$ is compact.
Maximality implies that $P$ is an $\varepsilon$-net: for every $x \in M$ there exists $i \in \{1,\dots,N\}$ such that $d_g(x,p_i) < \varepsilon$. Indeed, if no such $i$ existed, then $P \cup \{x\}$ would still be $\varepsilon$-separated, contradicting maximality. Therefore
\begin{align*}
M = \bigcup_{i=1}^{N} B_g(p_i,\varepsilon).
\end{align*}
The same separation condition implies that the open balls $B_g(p_i,r_\varepsilon)$ are pairwise disjoint. If $x \in B_g(p_i,r_\varepsilon) \cap B_g(p_j,r_\varepsilon)$ for $i \ne j$, then the triangle inequality gives
\begin{align*}
d_g(p_i,p_j)
&\le d_g(p_i,x) + d_g(x,p_j) \\
&< r_\varepsilon + r_\varepsilon \\
&= \varepsilon,
\end{align*}
contradicting $d_g(p_i,p_j) \ge \varepsilon$.[/step]