How Can You Arrange Points in a Square While Maintaining a Minimum Distance?

Click For Summary

Discussion Overview

The discussion revolves around the problem of arranging n points within a square of side length a, ensuring that the distance between any two points is at least 1. Participants explore potential methods for solving this problem, including considerations of randomness and grid arrangements.

Discussion Character

  • Exploratory, Debate/contested, Conceptual clarification

Main Points Raised

  • One participant poses the initial problem of arranging n points in a square while maintaining a minimum distance of 1 between them.
  • Another participant invites further thoughts and contributions on the problem, suggesting a collaborative approach.
  • A participant expresses difficulty in generating random points while ensuring the required distance condition is met.
  • One participant suggests that the problem may be open-ended, implying that there could be multiple approaches or solutions, and challenges others to think of a grid arrangement that guarantees the minimum distance.
  • This same participant also questions whether there exists a value of a for which no arrangement of points can satisfy the distance condition.

Areas of Agreement / Disagreement

Participants do not appear to reach a consensus on a specific solution or method for the problem. Multiple competing views and approaches remain, with some participants suggesting randomness and others considering structured arrangements.

Contextual Notes

The discussion does not clarify the assumptions regarding the values of n and a, nor does it address potential limitations in the proposed methods for ensuring the distance condition.

Galizius
Messages
14
Reaction score
0
Please post this type of questions in the homework forums, and always show how you tried to solve the problem by yourself.
I am wondering how can I solve following problem.
Arrange randomly n points inside a square of the side length a under the condition that the distance between any two points may not be smaller than 1.

I would like to see how can it be solved.
 
Physics news on Phys.org
And we would like to see your thoughts on the problem.
 
I was trying to make n random numbers in the selected a side length but I do not know how to make sure that the point-to-point distance between every of the n points will be always bigger than 1.
 
I believe this is an open question - that is, you are expected to show you can think, and there is one correct solution.

Can you think of any grid of (not random) points, where the shortest distance is guaranteed to be 1?

Can you think of an a for which there is no solution?
 

Similar threads

Graduate Calculating Probability of N Points on a Line Being Within Given Distance
  • · Replies 7 ·
Replies
7
Views
3K
Undergrad How can the maximum entropy and minimum energy principles be physical?
  • · Replies 13 ·
Replies
13
Views
4K
Undergrad How can concentration gradient field come into existence immediately?
  • · Replies 1 ·
Replies
1
Views
3K
Potential from point charge at distance ##l## from conducting sphere
  • · Replies 3 ·
Replies
3
Views
3K
Probability of a point in a square being 0.5 from perimeter
  • · Replies 7 ·
Replies
7
Views
2K
Calculate tilt angle of a bar lifted via two ropes on fixed points
  • · Replies 7 ·
Replies
7
Views
3K
To find the tipping point of a lamina
  • · Replies 2 ·
Replies
2
Views
1K
Graduate Existence of point(s) within k distance of other fixed points
  • · Replies 3 ·
Replies
3
Views
2K
High School How far away can a World So Newly Born Be at relativistic velocities?
  • · Replies 18 ·
Replies
18
Views
1K
Graduate How can a 1 kilometer body (3i/Atlas) flip 180 degrees suddenly?
  • · Replies 9 ·
Replies
9
Views
919