A library of good packings, coverings and maximal volume arrangements of points on the sphere in 3 dimensions having icosahedral symmetry. The number of points ranges from 60 to 78032
H. Alt, K. Buchin, S. Chaplick, O. Cheong, P. Kindermann, C. Knauer, and F. Stehn. Proceedings of the 28th International Symposium on Algorithms and Computation (ISAAC'17), 92, page 4:1--4:12. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, (December 2017)
D. Karger, and K. Onak. Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, page 1207--1216. Philadelphia, PA, USA, Society for Industrial and Applied Mathematics, (2007)
L. Epstein, and R. van Stee. Approximation and Online Algorithms, volume 4927 of Lecture Notes in Computer Science, Springer, Berlin / Heidelberg, (2008)
F. Chung, R. Graham, and G. Varghese. Proceedings of the sixteenth annual ACM symposium on Parallelism in algorithms and architectures, page 103--111. New York, NY, USA, ACM, (2004)