Algorithm putting point into square with maximal minimum distance
Posted
by Mikulas Dite
on Stack Overflow
See other posts from Stack Overflow
or by Mikulas Dite
Published on 2010-04-27T17:50:48Z
Indexed on
2010/04/27
17:53 UTC
Read the original article
Hit count: 516
algorithm
I'm stuck on this: Have a square. Put n points into this square so the minimal distance (not necessary the average distance) is the highest possible.
I'm looking for an algorithm which would be able to generate the coordinates of all points given the count of them.
Example results for n=4;5;6:
Please don't mention computing-power based stuff such as trying a lot of combination and then nitpicking the right one and similar ideas.
© Stack Overflow or respective owner