- New
-
Topics
- All Categories
- Metaphysics and Epistemology
- Value Theory
- Science, Logic, and Mathematics
- Science, Logic, and Mathematics
- Logic and Philosophy of Logic
- Philosophy of Biology
- Philosophy of Cognitive Science
- Philosophy of Computing and Information
- Philosophy of Mathematics
- Philosophy of Physical Science
- Philosophy of Social Science
- Philosophy of Probability
- General Philosophy of Science
- Philosophy of Science, Misc
- History of Western Philosophy
- Philosophical Traditions
- Philosophy, Misc
- Other Academic Areas
- Journals
- Submit material
- More
Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes
Artificial Intelligence 105 (1-2):47-75 (1998)
Abstract
This article has no associated abstract. (fix it)Other Versions
No versions found
My notes
Similar books and articles
On the complexity of labeling perspective projections of polyhedral scenes.Pietro Parodi & Vincent Torre - 1994 - Artificial Intelligence 70 (1-2):239-276.
Interpreting pictures of polyhedral scenes☆.A. K. Macworth - 1973 - Artificial Intelligence 4 (2):121-137.
Interpreting line drawings as three-dimensional surfaces.H. G. Barrow & J. M. Tenenbaum - 1981 - Artificial Intelligence 17 (1-3):75-116.
Retrospective on “Interpreting line drawings as three-dimensional surfaces”.Harry G. Barrow & J. M. Tenenbaum - 1993 - Artificial Intelligence 59 (1-2):71-80.
Linear constraints for the interpretation of line drawings of curved objects.Martin C. Cooper - 2000 - Artificial Intelligence 119 (1-2):235-258.
The Rapid Recovery of Three-Dimensional Structure from Line Drawings.Ronald A. Rensink - 1992 - Dissertation, University of British Columbia
N.J. Nilsson, Artificial Intelligence: A New Synthesis T. Dean, J. Allen and Y. Aloimonos, Artificial Intelligence: Theory and Practice D. Poole, A. Mackworth and R. Goebel, Computational Intelligence: A Logical Approach S. Russell and P. Norvig, Artificial Intelligence: A Modern Approach. [REVIEW]Benedict du Boulay - 2001 - Artificial Intelligence 125 (1-2):227-232.
Linear-time algorithms for testing the realisability of line drawings of curved objects.Martin C. Cooper - 1999 - Artificial Intelligence 108 (1-2):31-67.
A new result on the complexity of heuristic estimates for the A★ algorithm.Othar Hansson, Andrew Mayer & Marco Valtorta - 1992 - Artificial Intelligence 55 (1):129-143.
Analytics
Added to PP
2020-12-22
Downloads
14 (#1,321,670)
6 months
5 (#702,808)
2020-12-22
Downloads
14 (#1,321,670)
6 months
5 (#702,808)
Historical graph of downloads
Citations of this work
References found in this work
The complexity of some polynomial network consistency algorithms for constraint satisfaction problems.Alan K. Mackworth & Eugene C. Freuder - 1985 - Artificial Intelligence 25 (1):65-74.
Exploiting the deep structure of constraint problems.Colin P. Williams & Tad Hogg - 1994 - Artificial Intelligence 70 (1-2):73-117.
The hardest constraint problems: A double phase transition.Tad Hogg & Colin P. Williams - 1994 - Artificial Intelligence 69 (1-2):359-377.
Generating hard satisfiability problems.Bart Selman, David G. Mitchell & Hector J. Levesque - 1996 - Artificial Intelligence 81 (1-2):17-29.
PhilPapers logo by Andrea Andrews and Meghan Driscoll.
This site uses cookies and Google Analytics (see our terms & conditions for details regarding the privacy implications). Use of this site is subject to terms & conditions.
All rights reserved by The PhilPapers Foundation
Server: philpapers-web-8567d8d854-kjfxj dc2