2. applying the algorithm of Lempel et al. (1967) constructing a sequence of
bush forms Bk, 1 < k < n, by embedding a maximal number of outgoing
edges of a vertex k, 1 < k < n, in the outer face of Bk-t without crossings,
deleting all other outgoing edges of k.