DETERMINISTIC AND PROBABILISTIC APPROACHES TO LABELLING LINE DRAWINGS OF ENGINEERING OBJECTS

DOI10.1142/S0218654303000061zbMath1098.65031OpenAlexW2074900006MaRDI QIDQ5485814

P. A. C. Varley, Ralph R. Martin

Publication date: 4 September 2006

Published in: International Journal of Shape Modeling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218654303000061

zbMATH Keywords

Algorithmsrelaxation labellingline drawingsengineering objectsline labellingnon-trihedralpolyhedral solid objects

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Cites Work

• The complexity of recognizing polyhedral scenes
• Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes
• Linear-time algorithms for testing the realisability of line drawings of curved objects
• On the complexity of labeling perspective projections of polyhedral scenes

This page was built for publication: DETERMINISTIC AND PROBABILISTIC APPROACHES TO LABELLING LINE DRAWINGS OF ENGINEERING OBJECTS