Hall, A.Pomm, C.Widmayer, P.Michiel van de Panne and Eric Saund2014-01-282014-01-282007978-3-905674-00-21812-3503https://doi.org/10.2312/SBM/SBM07/007-014In this paper we propose a combinatorial model for sketch recognition. Two fundamental problems, the evaluation of individual symbols and the interpretation of a complete sketch scene possibly containing several symbols, are expressed as combinatorial optimization problems. We settle the computational complexity of the combinatorial problems and present a branch and bound algorithm for computing optimal symbol confidences. To handle sketch scenes in practice we propose a modest restriction of drawing freedom and present an algorithm which only needs to compute a polynomial number of symbol confidences.Categories and Subject Descriptors (according to ACM CCS): I.7.5 [Document and Text Processing]: Graphics Recognition and Interpretation