name:                circle-packing
version:             0.1.0.1
synopsis:            Simple heuristic for packing discs of varying radii in a circle
description:         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.
license:             BSD3
license-file:        LICENSE
author:              Joachim Breitner <mail@joachim-breitner.de>
maintainer:          Joachim Breitner <mail@joachim-breitner.de>
copyright:           2012, Joachim Breitner
category:            Optimisation
build-type:          Simple
cabal-version:       >=1.8
extra-source-files:
                     benchmark.hs
                     diagrams-demo.hs
                     fay/Makefile
                     fay/fay-demo.html
                     fay/fay-demo.hs
                     fay/fay-demo.js


library
  exposed-modules:   Optimisation.CirclePacking 
  build-depends:     base ==4.5.* || ==4.6.*
  ghc-options:       -Wall

source-repository head
    type:     darcs
    location: http://darcs.nomeata.de/circle-packing