Skip to main content
. 2018 Sep 25;2(3):177–231. doi: 10.1007/s41468-018-0021-5

Fig. 7.

Fig. 7

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