Abstract
How can we arrange n lines through the origin in three-dimensional Euclidean space in a way that maximizes the minimum interior angle between pairs of lines? Conway, Hardin, and Sloane (1996) produced line packings for that they conjectured to be within numerical precision of optimal in this sense, but until now only the cases have been solved. In this paper, we resolve the case n = 8. Drawing inspiration from recent work on the Tammes problem, we enumerate contact graph candidates for an optimal configuration and eliminate those that violate various combinatorial and geometric necessary conditions. The contact graph of the putatively optimal numerical packing of Conway, Hardin, and Sloane is the only graph that survives, and we recover from this graph an exact expression for the minimum distance of eight optimally packed points in the real projective plane.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
