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.<<ETX>>

[1]  M. B. Clowes,et al.  On Seeing Things , 1971, Artif. Intell..

[2]  Kokichi Sugihara,et al.  Mathematical Structures of Line Drawings of Polyhedrons-Toward Man-Machine Communication by Means of Line Drawings , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[3]  Christos H. Papadimitriou,et al.  The complexity of recognizing polyhedral scenes , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).

[4]  P. Sankar.  A vertex coding scheme for interpreting ambiguous trihedral solids , 1977 .

[5]  Kokichi Sugihara,et al.  Picture language for skeletal polyhedra , 1978 .

[6]  Lefteris M. Kirousis.  Effectively Labeling Planar Projections of Polyhedra , 1990, IEEE Trans. Pattern Anal. Mach. Intell..