|
This uses a Monte Carlo based simulated annealing algorithm to explore
the packing of small numbers of shapes inside other shapes. The objective
being to find the best packing of the smaller shapes into the larger one.
Can use any pair of shapes from the list;
Circles, Triangles, Squares, Pentagons, Hexagons, Heptagons and Octagons.
Recently built with Sun's JDK to replace the Microsoft.
Example Output
|