A polynomial algorithm for recognizing images of polyhedra
The problem of recognizing a 3D polyhedron from a 2-dimensional projection is studied. The problem is known to be NP-complete in general. A polynomial algorithm is presented, given some information about the non-contour lines of the image.
KeywordsPolynomial Time Projection Plane Polynomial Algorithm 2SAT Problem Boolean Equation
Unable to display preview. Download preview PDF.
- 1.P. Alevizos: Personal Communication, 1985.Google Scholar
- 2.M. B. Clawes: On Seeing Things, Artificial Intelligence 2, 79–1116, 1971.Google Scholar
- 3.D.A. Huffman: Impossible Objects as Nonsense Sentences, in Machine Intelligence 6, Meltzer and Michie (eds.), Edinburgh University Press, 1971.Google Scholar
- 4.L. M. Kirousis and C. H. Papadimitriou: The Complexity of Recognizing Polyhedral Scenes, Proc. 26th Annual IEEE Symposium on Foundations of Computer Science, 175–185, 1985.Google Scholar
- 5.K. Sugihara: Mathematical Structures of Line Drawings of Polyhedrons—Toward Man-Machine Communication by Means of Line Drawings, IEEE Trans on Pattern Analysis and Machine Intelligence, PAMI-4, 458–469, 1982.Google Scholar
- 6.Sugihara: Picture Language for Skeletal Polyhedra, Computer Graphics and Image Processing 8, 382–405, 1978.Google Scholar
- 7.D. Waltz: Generating Semantic Descriptions from Drawings of Scenes with Shadows, in The Psychology of Computer Vision, P. H. Winston (ed.), McGraw-Hill, 1975.Google Scholar