{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T10:09:18Z","timestamp":1742378958618},"reference-count":35,"publisher":"Elsevier BV","issue":"1-2","license":[{"start":{"date-parts":[[1998,10,1]],"date-time":"1998-10-01T00:00:00Z","timestamp":907200000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,25]],"date-time":"2013-07-25T00:00:00Z","timestamp":1374710400000},"content-version":"vor","delay-in-days":5411,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Artificial Intelligence"],"published-print":{"date-parts":[[1998,10]]},"DOI":"10.1016\/s0004-3702(98)00077-0","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T04:24:09Z","timestamp":1027657449000},"page":"47-75","source":"Crossref","is-referenced-by-count":25,"title":["Empirically-derived estimates of the complexity of labeling line drawings of polyhedral scenes"],"prefix":"10.1016","volume":"105","author":[{"given":"P.","family":"Parodi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Lancewicki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A.","family":"Vijh","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J.K.","family":"Tsotsos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0004-3702(98)00077-0_BIB1","series-title":"Proceedings of the ACM National Conference","first-page":"387","article-title":"The notion of quantitative invisibility and the machine rendering of solids","author":"Appel","year":"1967"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB2","series-title":"Random Graphs","author":"Bollobas","year":"1985"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB3","series-title":"Proceedings IJCAI-91","first-page":"331","article-title":"Where the really hard problems are","author":"Cheeseman","year":"1991"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB4","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0004-3702(71)90005-1","article-title":"On seeing things","volume":"2","author":"Clowes","year":"1971","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB5","series-title":"An Introduction to the Bootstrap","author":"Efron","year":"1993"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB6","series-title":"Computer Graphics: Principles and Practice","author":"Foley","year":"1990"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB7","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB8","series-title":"Robust Statistics: The Approach Based on Influence Functions","author":"Hampel","year":"1986"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB9","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0004-3702(94)90088-4","article-title":"The hardest constraint problems: a double phase transition","volume":"69","author":"Hogg","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB10","first-page":"295","article-title":"Impossible objects as nonsense sentences","volume":"6","author":"Huffman","year":"1971"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB11","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0004-3702(80)90004-1","article-title":"A theory of Origami world","volume":"13","author":"Kanade","year":"1980","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB12","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0004-3702(93)90063-H","article-title":"Fast parallel constraint satisfaction","volume":"64","author":"Kirousis","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB13","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1016\/0022-0000(88)90043-8","article-title":"The complexity of recognizing polyhedral scenes","volume":"37","author":"Kirousis","year":"1988","journal-title":"J. Computer and System Sciences"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB14","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0004-3702(85)90041-4","article-title":"The complexity of some polynomial network consistency algorithms for constraint satisfaction problems","volume":"25","author":"Mackworth","year":"1985","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB15","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/0004-3702(93)90170-G","article-title":"The complexity of constraint satisfaction revisited","volume":"59","author":"Mackworth","year":"1993","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB16","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/BF00128527","article-title":"Interpreting line drawings of curved objects","volume":"1","author":"Malik","year":"1987","journal-title":"Internat. J. Computer Vision"},{"issue":"1","key":"10.1016\/S0004-3702(98)00077-0_BIB17","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1007\/BF00127126","article-title":"Robust regression methods for computer vision: a review","volume":"6","author":"Meer","year":"1991","journal-title":"Internat. J. Comput. Vision"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB18","first-page":"901","article-title":"Random polygons determined by random lines in the plane","volume":"52","author":"Miles","year":"1964"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(98)00077-0_BIB19","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/0004-3702(95)00049-6","article-title":"Some pitfalls for experimenters with random SAT","volume":"81","author":"Mitchell","year":"1996","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB20","series-title":"Graphical Evolution","author":"Palmer","year":"1985"},{"issue":"2","key":"10.1016\/S0004-3702(98)00077-0_BIB21","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/BF00055000","article-title":"The complexity of understanding of origami scenes","volume":"18","author":"Parodi","year":"1996","journal-title":"Internat. J. Computer Vision"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB22","article-title":"Empirically-derived estimates of the complexity of labelling line drawings","author":"Parodi","year":"1996"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB23","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0004-3702(94)90107-4","article-title":"On the complexity of labeling line drawings of polyhedral scenes","volume":"70","author":"Parodi","year":"1994","journal-title":"Artificial Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB24","series-title":"Heuristics","author":"Pearl","year":"1984"},{"issue":"1\u20132","key":"10.1016\/S0004-3702(98)00077-0_BIB25","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0004-3702(95)00045-3","article-title":"Generating hard satisfiability problems","volume":"81","author":"Selman","year":"1996","journal-title":"Artificial Intelligence"},{"issue":"2","key":"10.1016\/S0004-3702(98)00077-0_BIB26","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0262-8856(93)90075-R","article-title":"Extraction of vanishing points of images of indoor and outdoor scenes","volume":"11","author":"Straforini","year":"1993","journal-title":"Image Vision Computing"},{"issue":"2","key":"10.1016\/S0004-3702(98)00077-0_BIB27","doi-asserted-by":"crossref","first-page":"298","DOI":"10.1109\/34.121797","article-title":"The recovery and understanding of a line drawing from indoor scenes","volume":"14","author":"Straforini","year":"1992","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB28","series-title":"Stochastic Geometry and its Applications","author":"Stoyan","year":"1996"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB29","doi-asserted-by":"crossref","first-page":"382","DOI":"10.1016\/0146-664X(78)90064-3","article-title":"Picture language for skeletal polyhedra","volume":"8","author":"Sugihara","year":"1978","journal-title":"Computer Graphics and Image Processing"},{"issue":"5","key":"10.1016\/S0004-3702(98)00077-0_BIB30","doi-asserted-by":"crossref","first-page":"458","DOI":"10.1109\/TPAMI.1982.4767289","article-title":"Mathematical structures of line drawings of polyhedrons","volume":"4","author":"Sugihara","year":"1982","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB31","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/0004-3702(84)90005-5","article-title":"An algebraic approach to shape-from-image problems","volume":"23","author":"Sugihara","year":"1984","journal-title":"Artificial Intelligence"},{"issue":"5","key":"10.1016\/S0004-3702(98)00077-0_BIB32","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1109\/TPAMI.1984.4767571","article-title":"A necessary and sufficient condition for a picture to represent a polyhedral scene","volume":"6","author":"Sugihara","year":"1984","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB33","series-title":"Proceedings International Joint Conference on Artificial Intelligence (IJCAI-89)","first-page":"1571","article-title":"The complexity of perceptual search tasks","author":"Tsotsos","year":"1989"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB34","series-title":"The Psychology of Computer Vision","first-page":"19","article-title":"Understanding line-drawings of scenes with shadows","author":"Waltz","year":"1975"},{"key":"10.1016\/S0004-3702(98)00077-0_BIB35","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/0004-3702(94)90104-X","article-title":"Exploiting the deep structure of constraint problems","volume":"70","author":"Williams","year":"1994","journal-title":"Artificial Intelligence"}],"container-title":["Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000770?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0004370298000770?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,12]],"date-time":"2019-04-12T10:50:42Z","timestamp":1555066242000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0004370298000770"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,10]]},"references-count":35,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[1998,10]]}},"alternative-id":["S0004370298000770"],"URL":"https:\/\/doi.org\/10.1016\/s0004-3702(98)00077-0","relation":{},"ISSN":["0004-3702"],"issn-type":[{"value":"0004-3702","type":"print"}],"subject":[],"published":{"date-parts":[[1998,10]]}}}