An algorithm for uniform random sampling of points in and on a hypersphere
A new algorithm is given for random sampling in the interior or on the surface of an n-dimensional hypersphere. The involved parametrization is some kind of polar coordinates. The authors compare also the computation time of this algorithm with earlier published ones on some high speed computers. They conclude that no algorithm is best for all computers.
scientific article; zbMATH DE number 3949571