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.
27. The method of claim 1 , wherein the establishing comprising inserting into a binary tree the multi-element graphic assembly with its respective group of graphic elements arranged in different ones of the possible relative positional arrangements to create respective candidate binary trees, and selecting one of the candidate binary trees as the candidate tree.