Linear-time algorithms for testing the realisability of line drawings of curved objects
From MaRDI portal
Publication:1285669
DOI10.1016/S0004-3702(98)00118-0zbMath0914.68193MaRDI QIDQ1285669
Publication date: 28 April 1999
Published in: Artificial Intelligence (Search for Journal in Brave)
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Parallel algorithms in computer science (68W10)
Related Items (8)
Tractability in constraint satisfaction problems: a survey ⋮ On tree-preserving constraints ⋮ 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 ⋮ Cyclic consistency: A local reduction operation for binary valued constraints ⋮ High-order consistency in valued constraint satisfaction
This page was built for publication: Linear-time algorithms for testing the realisability of line drawings of curved objects
