Mean distance between points of 2D array

Click For Summary
To calculate the median distance between points in an N x N array, one must first determine the distances for every possible pair of points and then rank these distances. The total number of distances is given by N²(N²-1)/2, with the median located near N²(N²-1)/4. Specific distance counts for values like 1, M, and √2 are also noted, indicating the complexity of the distribution. For large N, the median distance from a corner point to others approximates √(2N/π), while a center point yields √(N/2π). This problem is part of a broader investigation into antenna array configurations, revealing insights into the equivalence of linear and square arrays.
cosmik debris
Messages
734
Reaction score
172
Say I have an N X N array of points, I would like a formula to give the mean distance between the points. There are lots of short distances but only two long ones (diagonal). There are plenty of algorithms to do this but I would like to work out a formula if there is one. Can someone point me in the right direction?

Thanks
 
Mathematics news on Phys.org
You know how to find the distance between any two points right?
To get the mean distance, find the distances for every possible pair of points, add them up, and divide by the number of pairs.
 
Yeah I know how to calculate the distances, and I meant median not mean.
 
I that case you need to also rank the distances.
To my knowledge there is no "equation" that will do that.

The median is so that the number of data points above and below is the same.
 
My initial thoughts:
Number of points will be N², so number of distances will be N²(N²-1)/2.
So if theses distances were sorted by length, the one you would be looking for would be near N²(N²-1)/4.
As it turns out, N²(N²-1)/4 is always an integer, so it will always be possible that to get the median, you will be averaging between two values.

The number of distances of value 1 will be: 2·N(N-1)
The number of distances of integer value M will be: 2·N(N-M)
The number of distances of √2 will be 2·(N-1)²

Skipping to infinity:
When N is very large, the median distance between a corner point and all other points would be the radius of an arc that divides the square into equal areas: √(2N/π)
In contrast, a point near the center would be half that: √(N/2π)

Don't have time for more thinking right now.

Nasty problem.
 
Yes it's tricky. We managed to get a closed form solution for the continuous case and as it turns out it did give us an insight into our problem. In case you're interested; this is a massive MIMO investigation. We were trying to compare a linear array of antennas to a square array. It turns out that a linear array say 10m long is equivalent to a square array of about 6m X 6m, not really any improvement.
 
Here is a little puzzle from the book 100 Geometric Games by Pierre Berloquin. The side of a small square is one meter long and the side of a larger square one and a half meters long. One vertex of the large square is at the center of the small square. The side of the large square cuts two sides of the small square into one- third parts and two-thirds parts. What is the area where the squares overlap?

Similar threads

  • · Replies 1 ·
Replies
1
Views
2K
Replies
1
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 20 ·
Replies
20
Views
2K
  • · Replies 10 ·
Replies
10
Views
2K
  • · Replies 8 ·
Replies
8
Views
2K
  • · Replies 2 ·
Replies
2
Views
1K
  • · Replies 2 ·
Replies
2
Views
2K
  • · Replies 13 ·
Replies
13
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K