Article contents
On the Number of Spheres Which can Hide a Given Sphere
Published online by Cambridge University Press: 20 November 2018
Extract
Several years ago H. Hornich suggested the following problem: find the minimal number of unit spheres which can hide a unit sphere in the sense that each ray emanating from the centre of that sphere meets at least one of the hiding spheres, with no two of the spheres overlapping. We shall call any set of spheres which hide a given unit sphere a cloud.
The first result concerning this and related questions can be found in a paper of Fejes Tóth (4 ; see also 5, 7, 8, 6, and 1 ). With respect to the original problem, Fejes Tóth has given a lower estimate for the minimal number N of the spheres of a cloud.
- Type
- Research Article
- Information
- Copyright
- Copyright © Canadian Mathematical Society 1967
References
- 4
- Cited by