circle-packing: Simple heuristic for packing discs of varying radii in a circle

[ bsd3, library, optimisation ] [ Propose Tags ]

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.

Versions [faq] 0.1.0.0, 0.1.0.1, 0.1.0.2, 0.1.0.3, 0.1.0.4, 0.1.0.5, 0.1.0.6
Dependencies base (>=4.2 && <4.9) [details]
License BSD-3-Clause
Copyright 2012, Joachim Breitner
Author Joachim Breitner <mail@joachim-breitner.de>
Maintainer Joachim Breitner <mail@joachim-breitner.de>
Category Optimisation
Source repo head: darcs get http://darcs.nomeata.de/circle-packing
Uploaded by JoachimBreitner at Mon Dec 29 10:25:41 UTC 2014
Distributions LTSHaskell:0.1.0.6, NixOS:0.1.0.6, Stackage:0.1.0.6
Downloads 13203 total (291 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Hackage Matrix CI
Docs available [build log]
Last success reported on 2014-12-29 [all 1 reports]

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees