Simple heuristic for packing discs of varying radii in a circle
|LTS Haskell 20.23:||0.1.0.6@rev:4|
|Stackage Nightly 2023-05-31:||0.1.0.6@rev:4|
|Latest on Hackage:||0.1.0.6@rev:4|
This version can be pinned in stack with:
Module documentation for 0.1.0.6
Depends on 1 package(full list with versions):
Used by 1 package in lts-16.31(full list with versions):
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.