1. A method for arranging a set of graphic assemblies within an area, wherein at least one graphic assembly has more than one presentation, the method comprising: associating a presentation of a first graphic assembly from the set of graphic assemblies with a tree structure to form a candidate tree; modifying the candidate tree to form at least one alternate candidate tree by associating each presentation of a subsequent graphic assembly from the set of graphic assemblies with at least one available location in the candidate tree; computing scores for each alternate candidate tree with the subsequent graphic assembly in each possible presentation in the at least one available location on the candidate tree; selecting the alternate candidate tree having a best score; designating the alternate candidate tree having a best score to be the candidate tree; repeating the modifying, the computing, the selecting and the designating for all remaining graphic assemblies; and arranging the set of graphic assemblies within the area in accordance with the candidate tree.
1. A method for arranging a set of graphic assemblies within an area, wherein at least one graphic assembly has more than one presentation, the method comprising: associating a presentation of a first graphic assembly from the set of graphic assemblies with a tree structure to form a candidate tree; modifying the candidate tree to form at least one alternate candidate tree by associating each presentation of a subsequent graphic assembly from the set of graphic assemblies with at least one available location in the candidate tree; computing scores for each alternate candidate tree with the subsequent graphic assembly in each possible presentation in the at least one available location on the candidate tree; selecting the alternate candidate tree having a best score; designating the alternate candidate tree having a best score to be the candidate tree; repeating the modifying, the computing, the selecting and the designating for all remaining graphic assemblies; and arranging the set of graphic assemblies within the area in accordance with the candidate tree. 14. The method of claim 1 , wherein the computing comprises assessing minimum and maximum values for graphic element sizes of graphic elements in each alternate candidate tree, and determining the ratio of minimum graphic element size value divided by maximum graphic element size value.