In this paper we will generalize to higher dimension
the splitting procedure introduced by Kakutani for [0, 1]. This
method will provide a sequence of nodes belonging to [0, 1]^d which
is uniformly distributed. The advantage of this approach is that
it is intrinsecally d-dimensional.
