Embedding Shapes without Predefined Parts

Hacer Yalim Keles, Mine Özkar and Sibel Tari
Additional contact information
Hacer Yalim Keles: Computer Engineering Department, Middle East Technical University, Ankara 06531, Turkey
Mine Özkar: Department of Architecture, Middle East Technical University, Ankara 06531, Turkey
Sibel Tari: Computer Engineering Department, Middle East Technical University, Ankara 06531, Turkey

Environment and Planning B, 2010, vol. 37, issue 4, 664-681

Abstract: 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.

Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1068/b36010 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:envirb:v:37:y:2010:i:4:p:664-681

DOI: 10.1068/b36010

Access Statistics for this article

More articles in Environment and Planning B
Bibliographic data for series maintained by SAGE Publications ().