Linearized algorithm for computation of large circle packings
You are now following this Submission
- You will see updates in your followed content feed
- You may receive emails, depending on your communication preferences
GOPack computes circle packings, which are configurations of circles with prescribed patterns of tangency (not to be confused with 2D sphere packing). It is a linearized algorithm capable of quickly computing maximal circle packings and certain polygonal circle packings involving many hundreds of thousands of circles. It was developed by C. Collins, G. Orick, and K. Stephenson. Output is suitable for further manipulation in the Java package "CirclePack" available from Stephenson's web site.
Cite As
Kenneth Stephenson (2026). kensmath/GOPack (https://github.com/kensmath/GOPack), GitHub. Retrieved .
General Information
- Version 1.0.0.0 (22.7 MB)
-
View License on GitHub
MATLAB Release Compatibility
- Compatible with any release
Platform Compatibility
- Windows
- macOS
- Linux
Versions that use the GitHub default branch cannot be downloaded
| Version | Published | Release Notes | Action |
|---|---|---|---|
| 1.0.0.0 |
