15. A method for arranging graphic assemblies within an area, at least one graphic assembly having more than one possible presentation; comprising: (a) associating each presentation of a first graphic assembly with a tree structure to form at least one candidate tree; (b) computing a score for each candidate tree; (c) selecting the candidate tree having a best score; (d) modifying the candidate tree to form at least one alternate candidate tree by associating each presentation of a subsequent graphic assembly with each available location in the candidate tree; (e) computing a score for each alternate candidate tree with the subsequent graphic assembly in each possible presentation in each available location on the candidate tree; (f) selecting the alternate candidate tree having a best score; (g) designating the alternate candidate tree having a best score to be the candidate tree; (h) repeating (d), (e), (f) and (g) for all remaining graphic assemblies; and (i) arranging the graphic assemblies within the area in accordance with the candidate tree.
15. A method for arranging graphic assemblies within an area, at least one graphic assembly having more than one possible presentation; comprising: (a) associating each presentation of a first graphic assembly with a tree structure to form at least one candidate tree; (b) computing a score for each candidate tree; (c) selecting the candidate tree having a best score; (d) modifying the candidate tree to form at least one alternate candidate tree by associating each presentation of a subsequent graphic assembly with each available location in the candidate tree; (e) computing a score for each alternate candidate tree with the subsequent graphic assembly in each possible presentation in each available location on the candidate tree; (f) selecting the alternate candidate tree having a best score; (g) designating the alternate candidate tree having a best score to be the candidate tree; (h) repeating (d), (e), (f) and (g) for all remaining graphic assemblies; and (i) arranging the graphic assemblies within the area in accordance with the candidate tree. 16. The method of claim 15 , wherein the tree structure, candidate tree and each alternate candidate tree each comprises: at least one node; and at least one leaf emanating from one node wherein a subtree of the candidate tree comprises a location within the candidate tree and all nodes and leaves emanating from the location.