2. The method of claim 1 , wherein determining if the candidate tree is a feasible candidate tree comprises: generating a set of path lengths through the candidate tree; and verifying a fixed distance term for each path length fits within the area.
2. The method of claim 1 , wherein determining if the candidate tree is a feasible candidate tree comprises: generating a set of path lengths through the candidate tree; and verifying a fixed distance term for each path length fits within the area. 3. The method of claim 2 , further comprising determining an area of each of the set of graphic assemblies.