Abstract
Drawings of curved objects often contain many linear features: straight lines, colinear or coplanar points, parallel lines and vanishing points. These linear features give rise to linear constraints on the 3D position of scene points. The resulting problem can be solved by standard linear programming techniques. An important characteristic of this approach is that instead of making a strong assumption, such as all surfaces are planar, only a very weak assumption, which disallows coincidences and highly improbable objects, needs to be made to be able to deduce planarity. The linear constraints, combined with junction-labelling constraints, are a powerful means of discriminating between possible and impossible line drawings. They provide an important tool for the machine reconstruction of a 3D scene from a human-entered line drawing.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
