In this section we introduce the basic theoretical tools that have been developed for the analysis of the tractability of constraint satisfaction and valued constraint satisfaction problems. In the next section we apply some of these results to problems related to the interpretation of line drawings. A problem is considered to be tractable if there is a polynomial-time algorithm to solve it, and intractable if not. Assuming NP≠P, any problem that is NP-hard is intractable.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 2008 Springer-Verlag London Limited
About this chapter
Cite this chapter
(2008). Tractability of Drawing Interpretation. In: Line Drawing Interpretation. Springer, London. https://doi.org/10.1007/978-1-84800-229-6_9
Download citation
DOI: https://doi.org/10.1007/978-1-84800-229-6_9
Publisher Name: Springer, London
Print ISBN: 978-1-84800-228-9
Online ISBN: 978-1-84800-229-6
eBook Packages: Computer ScienceComputer Science (R0)