Separated block decomposition for vector subset sums

For Euclidean vectors $x_i$ of length at least one, their labeled subset sums can be partitioned into pairwise distance-at-least-one blocks, with $\left(\genfrac{}{}{0ex}{}{n}{r}\right)-\left(\genfrac{}{}{0ex}{}{n}{r-1}\right)$ blocks of size $n-2r+1$. To extend a separated block by a vector $x$, choose its member $y$ minimizing inner product with $x$. The translated block together with $y$ remains separated, since $(z+x-y)\cdot x\ge \Vert x{\Vert }^2$. The untransformed block with $y$ removed remains separated too. Block sizes change from $\ell$ to $\ell +1,\ell -1$, the same recurrence as a symmetric chain decomposition of a Boolean lattice. There are exactly $\left(\genfrac{}{}{0ex}{}{n}{\lfloor n/2\rfloor }\right)$ nonempty blocks.