How different can colours be? Maximum separation of points on a spherical octant

@article{Melisseny1998HowDC,
  title={How different can colours be? Maximum separation of points on a spherical octant},
  author={J. B. M. Melisseny},
  journal={Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences},
  year={1998},
  volume={454},
  pages={1499 - 1508},
  url={https://api.semanticscholar.org/CorpusID:122700006}
}
  • J. B. M. Melisseny
  • Published in Proceedings of the Royal… 8 May 1998
  • Mathematics
  • Proceedings of the Royal Society of London. Series A: Mathematical, Physical and Engineering Sciences
The problem of determining n different colours that are as distinct as possible can be formulated as finding n points on a spherical octant that maximize the minimum distance between the points. We will determine the maximum separation distance and all extremal configurations for n = 2, 3, 4, 5 and 6. Conjectures are given for 7 ⩽ n ⩽ 15. 
View on Royal Society
4 Citations
Background Citations
2

Figures from this paper

4 Citations

Optimal separation of points

How should n points be distributed in a given region F in R^d such that they are separated as much as possible?This general problem is studied in this paper, for some combinations of F, d, n, and t…

Circle packing on spherical caps

We have studied the packing of congruent disks on a spherical cap, for caps of different size and number of disks, N. This problem has been considered before only in the limit cases of circle packing…

Delimiting Maximal Kissing Configurations in Four Dimensions

How many unit $n-$dimensional spheres can simultaneously touch or kiss a central $n-$dimensional unit sphere? Beyond mathematics this question has implications for fields such as cryptography and the…

Your Contrastive Learning Is Secretly Doing Stochastic Neighbor Embedding

This work contributes to the theoretical understanding of SSCL and uncovers its connection to the classic data visualization method, stochastic neighbor embedding (SNE), whose goal is to preserve pairwise distances.

51 References

The Densest Packing of 9 Circles in a Square

Packing problems of this kind are obviously equivalent to the problems of placing k (here 9) points in a unit square such that the minimum distance between any two of them be as large as possible.…

On the Densest Packing of Spheres in a Cube

How many spheres of given diameter can be packed in a cube of given size? Or: What is the maximum diameter of k identical spheres if they can be packed in a cube of given size? These questions are…

The Densest Packing of Six Spheres in a Cube

This packing problem is obviously equivalent to the problem of locating six points Pi(l ≤ i ≤ 6) in a- closed unit cube C such that is as large as possible, where d(Pi, Pj) denotes the distance…

The densest packing of equal circles on a sphere

Conjectured solutions of the packing problem are found by using `exact' equations to refine approximations generated by the repulsion-energy method. Initial positions are selected randomly, and no…

More Optimal Packings of Equal Circles in a Square

The computer-aided approach to densest packings of n equal circles in a square is further developed here and the range is extended to n ≤ 27 .

On a Geometric Extremum Problem

The following problem was brought to our attention by L. Moser: Locate eight points in the closed unit square so that the minimum of the distances between any two of the points should be as large as…

Densest packings of eleven congruent circles in a circle

In 1969 Pirl provided the densest packings ofn equal circles in a circle forn ≤ 10. We will prove the optimality for the packings that were conjectured forn=11. The proof is based on elementary…

Finite point-sets on S2 with minimum distance as large as possible

A Finite Packing Problem

The maximum density of packings of a given type into the whole of a Euclidean space is defined to be the limit of the maximum density of such packings into a cube as the edge of the cube goes to…

The Densest Packing of Five Spheres in a Cube

The purpose of this paper is to locate five points Pi ( l ≤ i ≤ 5 ) in a closed unit cube C such that is as large as possible, where d(Pi, Pj) denotes the distance i j between Pi and Pj. We prove…
...