Add to ORKGAbstract: NP-hardness of parametric subshape recognition for an arbitrary number of open terms is proven. Guided by this understanding of the complexity of subshape recognition, a framework for computation-friendly parametric shape grammar interpreters is proposed, which is further detailed by a sub-framework over parametric two-dimensional rectangular shapes. As both the proof of NP-hardness and rectangular sub-framework invoke elements in graph theory, the relationship between shape and graph grammars is also explored
The ability to work with ambiguity and compute new designs based on both defined and emergent shapes...
Due to a growing number of regulations and standards, building performance becomes equally important...
Shape grammars are rule-based formalisms for the specification of shape languages. Most of the exist...
NP-hardness of parametric subshape recognition for an arbitrary number of open terms is proven. Guid...
Abstract: This paper explores the theoretical basis for a concept of “computation-friendly” shape gr...
Application of a shape grammar involves the repetitive task of matching and replacing subshapes of a...
The need to implement shape grammars efficiently, rather than hardcode them, in a way that supports ...
Abstract: Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their ...
Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their characteri...
Previously, we examined tractable parametric shape grammars and developed a general paradigm for imp...
A shape grammar provides the means to synthesize designs in the language defined by its rules throug...
Despite more than 30 years of research, shape grammar implementations have limited functionality. Th...
We propose and describe a working computer implementation for shape grammars that handles embedding ...
Shape grammars are a generative formalism in which dynamic changes to shape structure plays a vital ...
Shape grammars play an important role in a new generation of tools for the analysis and design of pr...
The ability to work with ambiguity and compute new designs based on both defined and emergent shapes...
Due to a growing number of regulations and standards, building performance becomes equally important...
Shape grammars are rule-based formalisms for the specification of shape languages. Most of the exist...
NP-hardness of parametric subshape recognition for an arbitrary number of open terms is proven. Guid...
Abstract: This paper explores the theoretical basis for a concept of “computation-friendly” shape gr...
Application of a shape grammar involves the repetitive task of matching and replacing subshapes of a...
The need to implement shape grammars efficiently, rather than hardcode them, in a way that supports ...
Abstract: Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their ...
Shape grammars are, in general, intractable. Even amongst tractable shape grammars, their characteri...
Previously, we examined tractable parametric shape grammars and developed a general paradigm for imp...
A shape grammar provides the means to synthesize designs in the language defined by its rules throug...
Despite more than 30 years of research, shape grammar implementations have limited functionality. Th...
We propose and describe a working computer implementation for shape grammars that handles embedding ...
Shape grammars are a generative formalism in which dynamic changes to shape structure plays a vital ...
Shape grammars play an important role in a new generation of tools for the analysis and design of pr...
The ability to work with ambiguity and compute new designs based on both defined and emergent shapes...
Due to a growing number of regulations and standards, building performance becomes equally important...
Shape grammars are rule-based formalisms for the specification of shape languages. Most of the exist...