Embedding shapes without predefined parts

Hacer Yalim Keles, Mine Özkar*, Sibel Tari

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

17 Citations (Scopus)


For a practical computer implementation of part embedding in shapes that is also true to their continuous character and the shape grammar formalism, shapes and their boundaries are handled together in composite shape and label algebras. Temporary representations of shapes, termed 'overcomplete graphs', comprise boundary elements of shapes and how they are assembled, and are utilized in a two-phase algorithm that systematically searches for embedded parts. The associated implementation is developed to receive user-defined constraints for an interactive search. In particular, the user-defined reference shape extends the search to nondeterministic cases.

Original languageEnglish
Pages (from-to)664-681
Number of pages18
JournalEnvironment and Planning B: Planning and Design
Issue number4
Publication statusPublished - 2010
Externally publishedYes


Dive into the research topics of 'Embedding shapes without predefined parts'. Together they form a unique fingerprint.

Cite this