  The LS-sequences of points recently introduced by the author are a
generalization of van der Corput sequences. They were constructed by reordering
the points of the corresponding LS-sequences of partitions. Here we present
another algorithm which coincides with the classical one for van der Corput
sequences and is simpler to compute than the original construction. This
algorithm is based on the representation of natural numbers in base $L+S$ and
gives the van der Corput sequence in base $b$ if $L=b$ and S=0. In this
construction, as well as in the van der Corput one, it is essential the
inversion of digits of the representation in base $L+S$: in this paper we also
give a nice geometrical explanation of this "magical" operation.
