• Find Bézout coefficients of the j-th element of the integer translations, as well as their greatest common divisor d ∈ * . To do so, we implemented an efficient algorithm from Havas et al. . • Set the j-th column of B as the sum of the integer translations weighted by their Bézout coefficient. • For each integer translation t ∈ 3 , update it to zero its j-th element by subtracting the new column of B times the quotient of the j-th element of t by d. By construction, after this step all translations have at most ( j -1) non-zero elements.