An algorithm for uniform random sampling of points in and on a hypersphere
type: Item
instance of: scholarly article
title: An algorithm for uniform random sampling of points in and on a hypersphere
zbMATH Open document ID: 0591.65006
DOI: 10.1016/0020-0190(85)90102-4
author: Gerald S. Guralnik
author: Charles Zemach
author: Tony Warnock
published in: Information Processing Letters
publication date: 1985-01-01T00:00:00Z
review text: 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.
Mathematics Subject Classification ID: 65C10
Mathematics Subject Classification ID: 65C05
zbMATH DE Number: 3949571
zbMATH Keywords: analysis of algorithms
zbMATH Keywords: simulation
zbMATH Keywords: random sampling
zbMATH Keywords: hypersphere
MaRDI profile type: Publication
full work available at URL: 0020-0190(85)90102-4
OpenAlex ID: W2016143993
cites work: Q4197958
cites work: A note on a method for generating points uniformly on n -dimensional spheres
cites work: Q4745749
cites work: Q5514935
cites work: A method for generating uniformly distributed points on \(N\)-dimensional spheres
cites work: Choosing a Point from the Surface of a Sphere
cites work: Improvements on fast methods for generating normal random variables
description: scientific article; zbMATH DE number 3949571