Matching spatial relation graphs using a constrained partial permutation strategy

A constrained partial permutation strategy is proposed for matching spatial relation graph (SRG), which is used in our sketch input and recognition system Smart Sketchpad for representing the spatial relationship among the components of a graphic object. Using two kinds of matching constraints dynamically generated in the matching process, the proposed approach can prune most improper mappings between SRGs during the matching process. According to our theoretical analysis in this paper, the time complexity of our approach is O(n 2) in the best case, and O(n!) in the worst case, which occurs infrequently. The spatial complexity is always O(n) for all cases. Implemented in Smart Sketchpad, our proposed strategy is of good performance.

闲暇时光，见出人的性情

兽和神大约都不会无聊。兽活命而已,只有纯粹的生存。神充实自足,具备完满的存在。兽人神三界,唯有夹在中间的人才会无聊,才可能有活得没意思的感觉和叹息。无聊的前提是闲。当人类必须为生存苦斗的时候,想必也无聊不起来。我们在诗经或荷马史诗里几乎找不到无聊这种奢侈的情绪。要能闲得无聊,首先必须仓廪实,衣食足,不愁吃穿。吃穿有余,甚至可以惠及畜生,受人豢养的猫狗之类宠物也会生出类似无聊的举态,但它们已经无权称作兽。