Kakutani's Splitting Procedure in Higher Dimension

Abstract

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