Pages that link to "Item:Q1109582"

The following pages link to The complexity of recognizing polyhedral scenes (Q1109582):

Displaying 12 items.

• Formula dissection: A parallel algorithm for constraint satisfaction (Q931750) (← links)
• Copositive-plus Lemke algorithm solves polymatrix games (Q1180832) (← links)
• Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes (Q1274552) (← links)
• Fast parallel constraint satisfaction (Q1313952) (← links)
• On the complexity of labeling perspective projections of polyhedral scenes (Q1342224) (← links)
• Linear constraints for the interpretation of line drawings of curved objects (Q1575188) (← links)
• Behaviorist intelligence and the scaling problem (Q1855224) (← links)
• An efficient parallel algorithm for geometrically characterising drawings of a class of 3-D objects (Q2273354) (← links)
• Properties of tree convex constraints (Q2389670) (← links)
• Pictures as Boolean formulas. A method for recognizing polyhedral scenes (Q2513326) (← links)
• Geometric methods for shape recovery from line drawings of polyhedra (Q2573016) (← links)
• Wireframe projections: physical realisability of curved objects and unambiguous reconstruction of simple polyhedra (Q2577837) (← links)