Abstract
This paper considers the distribution of distance between random points and shows how the distribution can be found when the points are chosen uniformly and independently in a hypersphere or in two adjacent unit squares. The value of a powerful extension of the classical Crofton technique is illustrated here for solving such geometric probability problems. This method is quite different from those employed by Hammersley and Oser.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
