Algorithm

1. Sort all pairs of attractor centers with respect to ascending distance between them:
$\left[ \left( R_{i_1}, R_{i_2} \right), \left( R_{i_3}, R_{i_4} \right) , \dots \right]$ , $|| R_{i_k} - R_{i_{k+1}} || \le || R_{i_l} - R_{i_{l+1}} ||$ , for all $k \le l$ .

2. $dir_X = R_{i_1} - R_{i_2}$
3. $$proj_X(t) = dir_X^T * data(t)$$

4. $dir_Y = R_{i_3} - R_{i_4}$
5. $$proj_Y(t) = dir_Y^T * data(t)$$

6. $dir_Z = R_{i_5} - R_{i_6}$
7. $$proj_Z(t) = dir_Z^T * data(t)$$

Orthogonalization:

$$ortho(v) = (I - dir_X^T * dir_X) * v$$

$dir_{Y'} = ortho(R_{i_3}) - ortho(R_{i_4})$
$proj_{Y'}(t) = dir_{Y'}^T * ortho(data(t))$