Revisiting Shape Embedding

Hacer Yalım Keleş, Mine Özkar, Sibel Tarı

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Citation (Scopus)

Abstract

We propose and describe a working computer implementation for shape grammars that handles embedding relations in two dimensional shapes. The technical framework proposed explores a graph data structure to temporarily represent boundary elements of shapes and how they are assembled. With the associated algorithms, this structure enables a systematic search for parts. The employment of user defined constraints allows for an interactive search. In accordance with the continuous character of shapes, the study puts forth a practical part detection method, which extends to non-deterministic cases.

Original languageEnglish
Title of host publicationComputation
Subtitle of host publicationThe New Realm of Architectural Design
EditorsGülen Çagdas, Birgül Çolakoglu
PublisherEducation and research in Computer Aided Architectural Design in Europe
Pages229-236
Number of pages8
ISBN (Print)9780954118389
Publication statusPublished - 2009
Externally publishedYes
Event27th Conference on Education and Research in Computer Aided Architectural Design in Europe, eCAADe 2009 - Istanbul, Turkey
Duration: 16 Sept 200919 Sept 2009

Publication series

NameProceedings of the International Conference on Education and Research in Computer Aided Architectural Design in Europe
ISSN (Print)2684-1843

Conference

Conference27th Conference on Education and Research in Computer Aided Architectural Design in Europe, eCAADe 2009
Country/TerritoryTurkey
CityIstanbul
Period16/09/0919/09/09

Bibliographical note

Publisher Copyright:
© 2004, Education and research in Computer Aided Architectural Design in Europe. All rights reserved.

Keywords

  • computation with shapes
  • part relations
  • Shape grammar interpreter

Fingerprint

Dive into the research topics of 'Revisiting Shape Embedding'. Together they form a unique fingerprint.

Cite this