Method for arranging graphic assemblies
First Claim
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 Assignment
0 Petitions
Accused Products
Abstract
A method for arranging a set of graphic assemblies within an area includes associating a presentation of a first graphic assembly 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 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 modifying, computing, selecting and designating for all remaining graphic assemblies; and arranging the set of graphic assemblies within the area in accordance with the candidate tree.
-
Citations
22 Claims
-
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. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14)
-
-
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. - View Dependent Claims (16, 17, 18)
- comprising;
-
19. A memory having computer-executable instructions for performing a method for arranging a set of graphic assemblies in an area, when executed by a computer the instructions cause the computer to perform operations 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 each 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 modifying, computing, selecting and designating for all remaining graphic assemblies; and arranging the set of graphic assemblies within the area in accordance with the candidate tree. - View Dependent Claims (20, 21)
-
-
22. A system for arranging a set of graphic assemblies within an area, the system comprising:
-
means for forming a candidate tree by associating a presentation of a first graphic assembly from the set of graphic assemblies with a tree structure; means for forming at least one alternate candidate tree by modifying the 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; means for 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; means for selecting the alternate candidate tree having a best score; means for designating the alternate candidate tree having a best score to be the candidate tree; and means for arranging the set of graphic assemblies within the area in accordance with the candidate tree.
-
Specification