A balloon net model is introduced and demonstrated for discovering improved solutions in one of unsolved problems in geometry which is referred to as a problem of `Spreading points in a square'. How should n points be arranged in a unit square so that the minimum distance between them is the greatest? Note that d(n) is the greatest possible minimum distance between n points in a unit square. Exact results are known for n≤9 and n = 14, 16, 25, and 36. Many investigators including Schaer, Meir, Kirchner, Wengerodt, Goldberg, Schluter, Valette and others have studied this geometrical problem for many years. The best known result is summarized in the book of `Unsolved Problems in Geometry' (H.T. Croft. K.J. Falconer and R.K. Guy/1991). We have found improved solutions for n = 13 and n = 15 by the proposed algorithm.
|出版ステータス||Published - 1995 12月 1|
|イベント||Proceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6) - Perth, Aust|
継続期間: 1995 11月 27 → 1995 12月 1
|Other||Proceedings of the 1995 IEEE International Conference on Neural Networks. Part 1 (of 6)|
|Period||95/11/27 → 95/12/1|
ASJC Scopus subject areas