I am studying a problem that requires me to partition the simplex into cells using a particular family of hyperplanes. For concreteness, consider the 2-simplex. I would like to construct lines emanating from each vertex to points on the opposite edge so that each of the cells generated by these lines has diameter at most $\epsilon$. What is the minimum number of lines that I must use at each vertex?
More generally, I am partitioning the $N$-simplex (with coordinates $(p_1, p_2, \ldots, p_N)$, $p_i \ge 0$, and $\sum_i p_i = 1$) using hyperplanes in the set $\cup_{i,j=1}^N \{p_i = r_\ell p_j\}_{\ell=1}^L$ for some set $\{r_\ell \}_{\ell=1}^L$ that I can choose. A cell is a set of points in the simplex characterized by the intersection of half-spaces generated by all the hyperplanes. What is the minimum value of $L$ needed so that the diameter of each cell is less than $\epsilon$? Is it possible to characterize the choice of $r_i$?
I'd be very appreciative of any references you may have. Happy to give more specifics or more details of the context.