5. The method of claim 1 , further comprising prior to arranging the set of graphic assemblies, generating a set of paths through the candidate tree, and determining if the candidate tree is feasible by verifying a fixed distance term for each path fits within the area.
5. The method of claim 1 , further comprising prior to arranging the set of graphic assemblies, generating a set of paths through the candidate tree, and determining if the candidate tree is feasible by verifying a fixed distance term for each path fits within the area. 6. The method of claim 5 , wherein the fixed distance term for each path includes a fixed spacing between adjacent graphic assemblies.