circle-packing

Simple heuristic for packing discs of varying radii in a circle

Version on this page:0.1.0.6@rev:3
LTS Haskell 23.19:0.1.0.6@rev:4
Stackage Nightly 2025-04-24:0.1.0.6@rev:4
Latest on Hackage:0.1.0.6@rev:4

See all snapshots circle-packing appears in

BSD-3-Clause licensed and maintained by Joachim Breitner
This version can be pinned in stack with:circle-packing-0.1.0.6@sha256:559042284ed745235e5cd5b84c333ca8b201a8acee12d710a5cddc6514419b65,2277

Module documentation for 0.1.0.6

Depends on 1 package(full list with versions):
base
Used by 1 package in lts-15.3(full list with versions):
diagrams-contrib

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.