SUSE Package Hub 15 one-click install Install ghc-circle-packing NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-Standard-Pool Package Hub 15 Dummy repo - this will fail ghc-circle-packing Simple heuristic for packing discs of varying radii in a circle 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. SUSE Package Hub 15 one-click install Install ghc-circle-packing NOTE: This one-click installation requires that the SUSE Package Hub extension to already be enabled. See http://packagehub.suse.com/how-to-use/ for information on enabling the Package Hub extension If the extension is not enabled, this installation will fail while trying to enable an invalid repo. This package might depend on packages from SUSE Linux Enterprise modules. If those modules are not enabled, a package dependency error will be encountered. SUSE-PackageHub-15-Standard-Pool Package Hub 15 Dummy repo - this will fail ghc-circle-packing Simple heuristic for packing discs of varying radii in a circle 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.