An algorithm for the labeling problem in the case of an origami world
The most important step in computer vision is the recovery of three-dimensional (3D) configurations of a scene from its image. A well-known method for interpreting such a planar image is to label its lines by the ClowesHuffman scheme. The type of scene described in this paper is a case of an origami world which is a model used for understanding line drawings in terms of surfaces, and for finding their 3D configurations. More specifically, the scene conserves attributes from trihedral world where only orthohedral polyhedral are allowed. It consists from these polyhedra with empty interior, having some of their faces. That missing faces may be transparent faces that a camera does not see. These polyhedra are referred to as boxes. The paper gives an efficient algorithm, which is a translation of the ClowesHuffman method, in the 2-SAT problem.
labeling origami 2-sat polyhedral scenes junctions