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 http://darcs.nomeata.de/circle-packing/ghcjs/ghcjs-demo.html.

Contributions of better algorithms are welcome.

Properties

Versions0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4, 0.1.0.5
Change logNone available
Dependenciesbase (>=4.2 && <4.10) [details]
LicenseBSD3
Copyright2012, Joachim Breitner
AuthorJoachim Breitner <mail@joachim-breitner.de>
MaintainerJoachim Breitner <mail@joachim-breitner.de>
CategoryOptimisation
Source repositoryhead: darcs get http://darcs.nomeata.de/circle-packing
UploadedFri Jan 29 09:57:25 UTC 2016 by JoachimBreitner
DistributionsLTSHaskell:0.1.0.5, NixOS:0.1.0.5, Stackage:0.1.0.5
Downloads7683 total (56 in last 30 days)
Votes
0 []
StatusDocs available [build log]
Last success reported on 2016-01-29 [all 1 reports]

Modules

[Index]

Downloads

Maintainers' corner

For package maintainers and hackage trustees