The complexity of recognizing polyhedral scenes

DOI10.1016/0022-0000(88)90043-8zbMath0655.68114OpenAlexW1965915487MaRDI QIDQ1109582

Lefteris M. Kirousis, Christos H. Papadimitriou

Publication date: 1988

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0022-0000(88)90043-8

zbMATH Keywords

computer visionNP-completepolyhedral scenes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Pattern recognition, speech recognition (68T10)

Related Items (14)

Fast parallel constraint satisfaction ⋮ On the complexity of labeling perspective projections of polyhedral scenes ⋮ Properties of tree convex constraints ⋮ Formula dissection: A parallel algorithm for constraint satisfaction ⋮ Copositive-plus Lemke algorithm solves polymatrix games ⋮ An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects ⋮ Pictures as Boolean formulas. A method for recognizing polyhedral scenes ⋮ Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes ⋮ DETERMINISTIC AND PROBABILISTIC APPROACHES TO LABELLING LINE DRAWINGS OF ENGINEERING OBJECTS ⋮ Linear constraints for the interpretation of line drawings of curved objects ⋮ Geometric methods for shape recovery from line drawings of polyhedra ⋮ Wireframe projections: physical realisability of curved objects and unambiguous reconstruction of simple polyhedra ⋮ Behaviorist intelligence and the scaling problem ⋮ Fast parallel constraint satisfaction

Cites Work

• A theory of Origami world
• Recovery of the three-dimensional shape of an object from a single view
• Planar Formulae and Their Uses
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The complexity of recognizing polyhedral scenes