@hackage circle-packing0.1.0.5

Simple heuristic for packing discs of varying radii in a circle

Categories
License
BSD-3-Clause
Maintainer
Joachim Breitner <mail@joachim-breitner.de>
Links
Versions
- 0.1.0.6 Sun, 17 May 2020
- 0.1.0.5 Fri, 29 Jan 2016
- 0.1.0.4 Mon, 29 Dec 2014
- 0.1.0.3 Mon, 23 Dec 2013
- 0.1.0.2 Mon, 17 Dec 2012
- 0.1.0.1 Sun, 16 Dec 2012

Installation
In your cabal file:
Dependencies (1)
- base >=4.2 && <4.3 || >=4.3 && <4.4 || >=4.4 && <4.5 || >=4.5 && <4.6 || >=4.6 && <4.7 || >=4.7 && <4.8 || >=4.8 && <4.9 || >=4.9 && <4.10
Dependents (2)
@hackage/diagrams-contrib, @hackage/acme-everything

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.

@hackage circle-packing0.1.0.5

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (1)

Dependents (2)