On the complexity of labeling perspective projections of polyhedral scenes

DOI10.1016/0004-3702(94)90107-4zbMath0938.68669OpenAlexW2084770565MaRDI QIDQ1342224

Pietro Parodi, Vincent Torre

Publication date: 21 June 2000

Published in: Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0004-3702(94)90107-4

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items (5)

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

Cites Work

• Unnamed Item
• Unnamed Item
• An algebraic approach to shape-from-image problems
• The complexity of recognizing polyhedral scenes
• A theory of Origami world
• New method for vanishing point detection
• Planar Formulae and Their Uses
• Determining perspective structures using hierarchical Hough transform
• The complexity of theorem-proving procedures

This page was built for publication: On the complexity of labeling perspective projections of polyhedral scenes