Michael Retchin edited Solution.tex  over 9 years ago

Commit id: f77ead22b89b184c5fcc6ad16787b89175d1e5d1

deletions | additions      

       

\section{Solution}  In general, a 100✕100 square lattice (representing 5cm by 5cm) was used to generate random tumors of discrete shapes and sizes. Non-intersecting circles were then placed randomly on the lattice, and a genetic algorithm was used to optimize circle placement and radii for accuracy. At no point was a circle allowed to intersect with another.In this way, the problem was generalized to a problem of circle-packing within randomly sized polygons within a square lattice.