A linear algorithm for labeling planar projections of polyhedra

A linear algorithm is given for the labelability problem of pictures with trihedral vertices and hidden lines. The main characteristic of the method is that it considers the faces of a given picture as Boolean variables and it constructs from the picture a Boolean formula. Based on the truth assignment of the picture's formula, a linear algorithm is developed for the labeling of the edges by the Clowes-Huffman scheme.<
>