The circle-packing package

[Tags: bsd3, library]

Given a number of circles with their radii, this packags tries to arrange them tightly, without overlap and forming a large circle.

Finding the optimal solution is NP hard, so only heuristics are feasible. This particular implementation is neither very good nor very fast, compared to the state of the art in research. Nevertheless it is simple to use and gives visually acceptable results.

Contributions of better algorithms are welcome.


Change logNone available
Dependenciesbase (>=4.5 && <4.7)
Copyright2012, Joachim Breitner
AuthorJoachim Breitner <>
MaintainerJoachim Breitner <>
Source repositoryhead: darcs get
UploadedMon Dec 17 09:17:57 UTC 2012 by JoachimBreitner
DistributionsLTSHaskell:, NixOS:, Stackage:
Downloads6180 total (281 in last 30 days)
StatusDocs uploaded by user
Build status unknown [no reports yet]




Maintainers' corner

For package maintainers and hackage trustees