Part embedding for shape grammars

Yalım Keleş, Hacer
Computational modeling of part relations of shapes is a challenging problem that has been addressed by many researchers since sixties. The most important source of the difficulty is the continuous nature of shapes, which makes the expression of shape very difficult in terms of discrete parts. When discrete parts are combined, they fuse and yield new parts, i.e. parts emerge. There is a number of methods that support emergent part detection. However all of these methods are based on strong assumptions in terms of what constitute a part. There is a need for a generic solution that treats a shape independently of any restriction resulting from analytical, geometrical, or logical abstractions. To this end, we have developed two novel strategies, which can be used both separately and jointly. Both strategies are relatable to the algebraic formalization of shape grammars (by Stiny). In the course of this thesis work, we have introduced a novel data structure called Over-Complete Graph to address the problem of part embedding in the existence of discrete registration marks; and we have developed a novel and robust method for the automatic selection of registration marks. Both developments are certainly useful for other visual problems. On the application side, we have tested our techniques on puzzling Seljuk patterns (from Kayseri) to demonstrate how the developed techniques give way to computational creativity. Apart from the techniques we have developed, the most important contribution of our work is that shapes are treated as perceived wholes rather than composed, as compellingly demonstrated by Seljuk pattern experiments.
Citation Formats
H. Yalım Keleş, “Part embedding for shape grammars,” Ph.D. - Doctoral Program, Middle East Technical University, 2010.