Embedding shapes without predefined parts

Creative Commons License

Keles H. Y., Ozkar M., TARI Z. S.

ENVIRONMENT AND PLANNING B-PLANNING & DESIGN, cilt.37, sa.4, ss.664-681, 2010 (SSCI) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 37 Sayı: 4
  • Basım Tarihi: 2010
  • Doi Numarası: 10.1068/b36010
  • Dergi Adı: ENVIRONMENT AND PLANNING B-PLANNING & DESIGN
  • Derginin Tarandığı İndeksler: Social Sciences Citation Index (SSCI), Scopus
  • Sayfa Sayıları: ss.664-681
  • Orta Doğu Teknik Üniversitesi Adresli: Evet

Özet

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.