Patent Document ID: 8056013
Application ID: 11128543

Base Claim:
1. A machine-implemented method of arranging a set of graphic assemblies within an area, comprising: establishing a candidate tree having at least one node and at least one leaf, wherein each node corresponds to a respective partition of the area, each leaf defines a relative position of a different respective one of the graphic assemblies in the area, and at least one of the graphic assemblies is a multi-element graphic assembly that comprises a respective group of multiple discrete graphic elements arranged in one of multiple possible relative positional arrangements within the area; determining if the candidate tree is a feasible candidate tree; and in response to a determination that the candidate tree is a feasible candidate tree, arranging the set of graphic assemblies within the area in accordance with the candidate tree.

---

Claim 2:
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.