Towards the Mass Customization of Housing: The Grammar of Siza's Houses at Malagueira

2005 ◽  
Vol 32 (3) ◽  
pp. 347-380 ◽  
Author(s):  
José Pinto Duarte
Keyword(s):  
Computer System ◽  
Mass Customization ◽  
Shape Grammar ◽  
Shape Grammars ◽  
Design Rules ◽  
Mass Housing ◽  
System A ◽  
Functional Zones

The goal of the described research is an interactive computer system for the design of customized mass housing. Shape grammars are the formalism proposed to systematize the design rules required for such a system. A shape grammar for Alvaro Siza's patio houses at Malagueira, a 1200-unit development still being designed and constructed today, is presented. The grammar is based on the corpus of thirty-five houses designed between 1977 and 1996. The generation of houses in the grammar proceeds by the recursive dissection of rectangles locating four different functional zones (patio, living, services, and sleeping) and the key placement of the staircase. The schematic generations of two existing houses and the detailed generation of a novel one illustrate the grammar.

scholarly journals A graph-theoretic implementation of the Rabo-de-Bacalhau transformation grammar

2016 ◽  
Vol 30 (2) ◽  
pp. 138-158 ◽  
Author(s):  
Tiemen Strobbe ◽  
Sara Eloy ◽  
Pieter Pauwels ◽  
Ruben Verstraeten ◽  
Ronald De Meyer ◽  
...  
Keyword(s):  
Computer System ◽  
Computer Aided Design ◽  
Research Question ◽  
Shape Grammar ◽  
Design Practice ◽  
Shape Grammars ◽  
Graph Theoretic ◽  
Computer Aided ◽  
Aided Design ◽  
The Impact

AbstractShape grammars are rule-based formalisms for the specification of shape languages. Most of the existing shape grammars are developed on paper and have not been implemented computationally thus far. Nevertheless, the computer implementation of shape grammar is an important research question, not only to automate design analysis and generation, but also to extend the impact of shape grammars toward design practice and computer-aided design tools. In this paper, we investigate the implementation of shape grammars on a computer system, using a graph-theoretic representation. In particular, we describe and evaluate the implementation of the existing Rabo-de-Bacalhau transformation grammar. A practical step-by-step approach is presented, together with a discussion of important findings noticed during the implementation and evaluation. The proposed approach is shown to be both feasible and valuable in several aspects: we show how the attempt to implement a grammar on a computer system leads to a deeper understanding of that grammar, and might result in the further development of the grammar; we show how the proposed approach is embedded within a commercial computer-aided design environment to make the shape grammar formalism more accessible to students and practitioners, thereby increasing the impact of grammars on design practice; and the proposed step-by-step implementation approach has shown to be feasible for the implementation of the Rabo-de-Bacalhau transformation grammar, but can also be generalized using different ontologies for the implementation.

Research on Reconfigurable High-Speed Serial Bus Used in High-Reliability Embedded Computer

2010 ◽  
Vol 20-23 ◽  
pp. 774-778
Author(s):  
Rui Ding ◽  
Yong Qin Hu ◽  
Wei Gong Zhang ◽  
Bo Yang
Keyword(s):  
Computer System ◽  
High Speed ◽  
Communication Protocol ◽  
High Reliability ◽  
Dynamic Reconfiguration ◽  
System A ◽  
Embedded Computer ◽  
Key Points ◽  
Application Scope

The characteristics and limitations of the buses, which are widely used nowadays, are analyzed in this paper. Because these buses don’t adapt to the high-reliability embedded computer system, a novel bus is proposed which is characterized by its high-reliability. And its capacity is reached through its unique datum’s dynamic reconfiguration mechanism. The basic architecture and communication protocol are presented in this paper. And then the key points during realization of this bus are discussed. Finally, the probably application scope and prospects are indicated.

Shape Grammars and Their Languages: A Methodology for Product Design and Product Representation

1997 ◽  
Author(s):  
Manish Agarwal ◽  
Jonathan Cagan
Keyword(s):  
Product Design ◽  
Shape Grammar ◽  
Shape Grammars ◽  
Product Representation ◽  
Competitive Products ◽  
Infinite Set

Abstract This paper argues that shape grammars and the languages they define are an ideal means to generate and represent products where basic functionality can be decomposed into discrete processes, forms can be created to fulfill those functional processes, and variation in those forms differentiates between competitive products. A shape grammar for the design of coffee makers is highlighted and used to illustrate how an infinite set of a class of products can be articulated through a concise shape grammar. Novel coffee makers and coffee makers in the market today are generated from the grammar.

Re-Coding Homes

2020 ◽  
pp. 1-19
Keyword(s):  
User Interface ◽  
Expert System ◽  
Interior Design ◽  
Mass Customization ◽  
Spatial Variations ◽  
Design Model ◽  
User Needs ◽  
Mass Housing ◽  
Layout Generation

The research project Re-Coding Homes aims to create flexible interior design solutions for standard mass housing units and differentiate them according to different user needs. The study consists of three basic steps defined as case study, development of the design model, and development of the user interface. The design model is characterized by a flexible expert system that leads to different spatial variations by multi-parametric layout generation based on parameters determined by user needs. In this sense, the design model acts as a mass customization tool that gives the possibility to create complete living environments together with all furniture and necessary equipment.

Enabling the Use of Shape Grammars: Shape Grammar Interpretation Through General Shape Recognition

2000 ◽  
Author(s):  
Jay McCormack ◽  
Jonathan Cagan
Keyword(s):  
Shape Recognition ◽  
Shape Grammar ◽  
Shape Grammars ◽  
General Shape ◽  
Engineering Applications ◽  
Ongoing Research ◽  
Research Challenge

Abstract Shape grammars have recently shown promise in engineering applications. The need to efficiently implement such grammars, rather than hard code them, in a way that supports creativity through shape emergence has still remained an ongoing research challenge. This paper introduces a shape grammar interpreter that supports parametric shape recognition, and thereby shape emergence. The approach divides shapes into hierarchies of subshapes based on specified geometric relationships within the shape. A default hierarchy based on geometric relations often found in engineering and architectural designs is presented as an efficient example of one appropriate hierarchy. A classic shape grammar demonstrates the interpreter’s shape recognition and generation abilities.

Computing with Emergence

2003 ◽  
Vol 30 (1) ◽  
pp. 125-155 ◽  
Author(s):  
Terry Knight
Keyword(s):  
19Th Century ◽  
Shape Grammar ◽  
Creative Design ◽  
Shape Grammars ◽  
Design Problems ◽  
Philosophy Today ◽  
History Of ◽  
Special Rules ◽  
Computational Systems

The concept of emergence has its roots in 19th-century philosophy. Today it is central to many computational systems which retain the hallmarks of emergence laid out much earlier. The role of emergence in creative design and its unique embodiment in shape grammars have been emphasized by March, Stiny, and others. Shape grammars generate emergent shapes—shapes not predefined in a grammar. Emergent shapes are not only the output of a shape grammar computation; they can be the input for further computation. The history of emergence and its characterization in shape grammars are discussed here. Different sorts of shape emergence in grammars are then distinguished: anticipated, possible, and unanticipated. Unanticipated emergent shapes are shapes not premeditated by the author or user of a grammar. Generally, unanticipated shapes require on-the-spot definitions of rules to compute with them. However, for some interesting design problems, it is possible to know in advance what to do with unanticipated shapes, and to predefine rules accordingly. Special rules for computing with unanticipated shapes are proposed here. These rules allow for processes that have previously been handled extragrammatically—outside of grammars—to be handled within grammars. Examples of applications of these rules within a single grammar and across parallel grammars are given.

Sign in / Sign up

Export Citation Format

Share Document