TORO: In this section, we present the details our algorithm uses to replace the oracle. Recall that we presented an algorithm to solve the indexing problem that relies on an oracle which provides the true Miller indices for the reciprocal spots in Q. While this is seemingly a strong assumption, in this section we show that with enough computing power, a sampling strategy can play the role of this oracle. Recall that we assume that the structure of the ideal crystal lattice basis vectors is given, i.e., we know the ideal norms of a, b, c and the ideal angles between them (the actual solution might differ slightly from these ideal conditions). Thus, we can assume that we are given a matrix M ⋆ 0 := (a ⋆ 0 , b ⋆ 0 , c ⋆ 0 ) T , being the given ideal crystal lattice basis with an arbitrary orientation.