Fig. 7.
Example of the labeling induced by formula (11). We assume that where is a simplex of with three different vertices . In this example, the tree connects as well as and the edge is not in the tree. On the right, we give the induced labeling of vertices of which determines a simplicial map to . The bottom and left faces of are in the tree, hence the bottom and left extended faces in are all mapped into R. The right face of is the edge that is not in the tree: the corresponding right extended face in is mapped to a loop , where is the only part that is not in the tree. The bold edges are sent to the edge . The most interior simplex in is highlighted and is the only one mapped to
