Abstract. For each n = 1, 2, . . . , let GL(n, Z) ⋉ Z n be the affine group over the integers. For every point x = (x 1 , . . . , xn) ∈ R n let orb(x) = {γ(x) ∈ R n | γ ∈ GL(n, Z) ⋉ Z n }. Let Gx be the subgroup of the additive group R generated by x 1 , . . . , xn, 1. If rank(Gx) = n then orb(x) = {y ∈ R n | Gy = Gx}. Thus, Gx is a complete classifier of orb(x). By contrast, if rank(Gx) = n, knowledge of Gx alone is not sufficient in general to uniquely recover orb(x): as a matter of fact, Gx determines precisely max (1, φ(d) 2 ) different orbits, where d is the denominator of the smallest positive nonzero rational in Gx, and φ is Euler function. To get a complete classification, rational polyhedral geometry provides an integer 1 ≤ cx ≤ max(1, d/2) such that orb(y) = orb(x) iff (Gx, cx) = (Gy, cy).