Hit-and-Run is known to be one of the best random sampling algorithms, its mixing time is polynomial in dimension. However in practice, the number of steps required to obtain uniformly distributed samples is rather high. We propose a new random walk algorithm based on billiard trajectories. Nu- merical experiments demonstrate much faster convergence to the uniform distribution. Keywords: Sampling, Monte-Carlo, Hit-and-Run, Billiards