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

Versions 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4, 0.1.0.5
Dependencies base (>=4.2 && <4.10) [details]
License BSD3
Copyright 2012, Joachim Breitner
Author Joachim Breitner <mail@joachim-breitner.de>
Maintainer Joachim Breitner <mail@joachim-breitner.de>
Stability Unknown
Category Optimisation
Source repository head: darcs get http://darcs.nomeata.de/circle-packing
Uploaded Fri Jan 29 09:57:25 UTC 2016 by JoachimBreitner
Distributions LTSHaskell:0.1.0.5, NixOS:0.1.0.5, Stackage:0.1.0.5
Downloads 7821 total (21 in the last 30 days)
Votes
1 []
Status Docs available [build log]
Last success reported on 2016-01-29 [all 1 reports]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees