No Repeated Distances

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram CDF Player or other Wolfram Language products.

Requires a Wolfram Notebook System

Edit on desktop, mobile and cloud with any Wolfram Language product.

Pick lattice points so that all distances between two points are unique. What is the tightest packing of these points? This Demonstration shows the best known results, as given in [1].

Contributed by: Ed Pegg Jr (May 2013)
Based on results of a contest by Al Zimmermann
Open content licensed under CC BY-NC-SA


Snapshots


Details

The tightest packing problem was the subject of [1]. Of the many participants, the winner was Hugo Pfoertner.

Reference

[1] A. Zimmermann. "Al Zimmermann's Programming Contests: Point Packing." (Oct 10, 2009) www.azspcs.net/Contest/PointPacking/FinalReport.



Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.
Send