Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes

DOI10.1016/S0004-3702(98)00077-0zbMath0909.68099OpenAlexW2036022677MaRDI QIDQ1274552

R. Lancewicki, A. Vijh, Pietro Parodi, John K. Tsotsos

Publication date: 12 January 1999

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

Full work available at URL: https://doi.org/10.1016/s0004-3702(98)00077-0

zbMATH Keywords

computational complexityline drawingsrandom polyhedral scenes

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25)

Related Items

Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes ⋮ DETERMINISTIC AND PROBABILISTIC APPROACHES TO LABELLING LINE DRAWINGS OF ENGINEERING OBJECTS ⋮ Geometric methods for shape recovery from line drawings of polyhedra

Uses Software

• bootstrap

Cites Work

• An algebraic approach to shape-from-image problems
• The complexity of recognizing polyhedral scenes
• A theory of Origami world
• Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes
• Fast parallel constraint satisfaction
• The hardest constraint problems: A double phase transition
• Exploiting the deep structure of constraint problems
• On the complexity of labeling perspective projections of polyhedral scenes
• Generating hard satisfiability problems
• Some pitfalls for experimenters with random SAT
• The complexity of constraint satisfaction revisited
• RANDOM POLYGONS DETERMINED BY RANDOM LINES IN A PLANE
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes