skip to main content
10.1145/378583.378624acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
Article

Sphere packings and generative

Published:01 June 2001Publication History

ABSTRACT

In 1998, the oldest problem in discrete geometry, the 400-year old Kep ler conjecture, was solved. The conjecture asserts that the familiar cannonball packing of balls achieves the greatest density of any possible packing. The proof of the conjecture was unusually long, requiring nearly 300 pages of careful reasoning, 3 gigabytes of stored data, and 40,000 lines of specialized computer code. The computer verifications required for the proof were carried out over a period of years.

This lecture will propose a new, vastly simplified, intuitive solution of the Kepler conjecture based on ideas from the field of generative programming.

Index Terms

  1. Sphere packings and generative

    Recommendations

    Comments

    Login options

    Check if you have access through your login credentials or your institution to get full access on this article.

    Sign in
    • Published in

      cover image ACM Conferences
      SCG '01: Proceedings of the seventeenth annual symposium on Computational geometry
      June 2001
      326 pages
      ISBN:158113357X
      DOI:10.1145/378583

      Copyright © 2001 ACM

      Publisher

      Association for Computing Machinery

      New York, NY, United States

      Publication History

      • Published: 1 June 2001

      Permissions

      Request permissions about this article.

      Request Permissions

      Check for updates

      Qualifiers

      • Article

      Acceptance Rates

      SCG '01 Paper Acceptance Rate39of106submissions,37%Overall Acceptance Rate625of1,685submissions,37%
    • Article Metrics

      • Downloads (Last 12 months)1
      • Downloads (Last 6 weeks)0

      Other Metrics

    PDF Format

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader
    About Cookies On This Site

    We use cookies to ensure that we give you the best experience on our website.

    Learn more

    Got it!