Finite point-sets on S 2 with minimum distance as large as possible

DOI10.1016/0012-365X(86)90002-6zbMath0644.52007MaRDI QIDQ1102548

B. George

Publication date: 1986

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

minimum distance; optimal k-set

Mathematics Subject Classification ID

52A40: Inequalities and extremum problems involving convexity in convex geometry

52A37: Other problems of combinatorial convexity

52C17: Packing and covering in (n) dimensions (aspects of discrete geometry)

05B40: Combinatorial aspects of packing and covering

Related Items

The second and the third smallest distances on the sphere