Various Monte Carlo techniques for random point generation over sets of interest are widely used in many areas computational mathematics, optimization, data processing, etc. Whereas regularly shaped such sampling is immediate to arrange, nontrivial, implicitly specified domains these not easy implement. We consider the so-called Hit-and-Run algorithm, a representative class Markov chain methods...