An algorithm for uniform random sampling of points in and on a hypersphere

DOI10.1016/0020-0190(85)90102-4zbMath0591.65006OpenAlexW2016143993MaRDI QIDQ1075007

Tony Warnock, Charles Zemach, Gerald Guralnik

Publication date: 1985

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(85)90102-4

zbMATH Keywords

simulationanalysis of algorithmsrandom samplinghypersphere

Mathematics Subject Classification ID

Monte Carlo methods (65C05) Random number generation in numerical analysis (65C10)

Related Items (5)

On the Ball-Constrained Weighted Maximin Dispersion Problem ⋮ Estimation of stress-strength reliability for the multivariate SGPII distribution ⋮ On decompositional algorithms for uniform sampling from \(n\)-spheres and \(n\)-balls ⋮ A High Performance Computing and Sensitivity Analysis Algorithm for Stochastic Many-Particle Wave Scattering ⋮ Factorization, invariant measure, and random selection of matrices in SU(n) and other groups

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A method for generating uniformly distributed points on \(N\)-dimensional spheres
• Improvements on fast methods for generating normal random variables
• A note on a method for generating points uniformly on n -dimensional spheres
• Choosing a Point from the Surface of a Sphere

This page was built for publication: An algorithm for uniform random sampling of points in and on a hypersphere