Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
P. Alevizos: Personal Communication, 1985.
M. B. Clawes: On Seeing Things, Artificial Intelligence 2, 79–1116, 1971.
D.A. Huffman: Impossible Objects as Nonsense Sentences, in Machine Intelligence 6, Meltzer and Michie (eds.), Edinburgh University Press, 1971.
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.
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.
Sugihara: Picture Language for Skeletal Polyhedra, Computer Graphics and Image Processing 8, 382–405, 1978.
D. Waltz: Generating Semantic Descriptions from Drawings of Scenes with Shadows, in The Psychology of Computer Vision, P. H. Winston (ed.), McGraw-Hill, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1986 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kirousis, L.M. (1986). A polynomial algorithm for recognizing images of polyhedra. In: Makedon, F., Mehlhorn, K., Papatheodorou, T., Spirakis, P. (eds) VLSI Algorithms and Architectures. AWOC 1986. Lecture Notes in Computer Science, vol 227. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-16766-8_17
Download citation
DOI: https://doi.org/10.1007/3-540-16766-8_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-16766-2
Online ISBN: 978-3-540-38746-6
eBook Packages: Springer Book Archive