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.

You can explore the algorithm live at

Contributions of better algorithms are welcome.


Dependencies base (>=4.2 && <4.10) [details]
License BSD3
Copyright 2012, Joachim Breitner
Author Joachim Breitner <>
Maintainer Joachim Breitner <>
Stability Unknown
Category Optimisation
Source repository head: darcs get
Uploaded Fri Jan 29 09:57:25 UTC 2016 by JoachimBreitner
Distributions LTSHaskell:, NixOS:, Stackage:, Tumbleweed:
Downloads 7880 total (18 in the last 30 days)
1 []
Status Docs available [build log]
Last success reported on 2016-01-29 [all 1 reports]




Maintainer's Corner

For package maintainers and hackage trustees