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 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.

Modules

[Last Documentation]

Optimisation
- Optimisation.CirclePacking

Downloads

circle-packing-0.1.0.0.tar.gz [browse] (Cabal source package)
Package description (as included in the package)

Maintainer's Corner

Package maintainers

JoachimBreitner

For package maintainers and hackage trustees

edit package information

Candidates

No Candidates

Versions [RSS]	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.5 && <4.6) [details]
License	BSD-3-Clause
Author	Joachim Breitner
Maintainer	mail@joachim-breitner.de
Category	Optimisation
Source repo	head: darcs get http://darcs.nomeata.de/circle-packing
Uploaded	by JoachimBreitner at 2012-12-15T17:08:52Z
Distributions	LTSHaskell:0.1.0.6, NixOS:0.1.0.6, Stackage:0.1.0.6
Reverse Dependencies	2 direct, 27 indirect [details]
Downloads	17605 total (58 in the last 30 days)
Rating	2.0 (votes: 1) [estimated by Bayesian average]
Your Rating	λ λ λ
Status	Docs not available [build log] All reported builds failed as of 2016-12-22 [all 7 reports]