AbstractBased on a discrete curvature (DC) notation [1], we propose an approach for mapping 2D shapes into strings. This mapping is invariant under translation, rotation, and scaling, and allows the usage of grammatical techniques for shape classification
Abstract. Shape grammars specify a mechanism for performing recursive shape computations. A general ...
We introduce S2, a typed intermediate language for vectors, based on a 2-level type-theory, which di...
Shape grammars are rule-based formalisms for the specification of shape languages. Most of the exist...
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symm...
Shape grammars are a generative formalism in which dynamic changes to shape structure plays a vital ...
A shape grammar provides the means to synthesize designs in the language defined by its rules throug...
We propose and describe a working computer implementation for shape grammars that handles embedding ...
NP-hardness of parametric subshape recognition for an arbitrary number of open terms is proven. Guid...
Abstract: NP-hardness of parametric subshape recognition for an arbitrary number of open terms is pr...
The paper starts by giving a motivation for studying grammars in design and is based on consideratio...
Application of a shape grammar involves the repetitive task of matching and replacing subshapes of a...
Previously, we examined tractable parametric shape grammars and developed a general paradigm for imp...
International audienceAnalysis of intrinsic symmetries of non-rigid and articulated shapes is an imp...
Shape grammars specify a mechanism for performing recursive shape computations. A general paradigm i...
Abstract: This paper explores the theoretical basis for a concept of “computation-friendly” shape gr...
Abstract. Shape grammars specify a mechanism for performing recursive shape computations. A general ...
We introduce S2, a typed intermediate language for vectors, based on a 2-level type-theory, which di...
Shape grammars are rule-based formalisms for the specification of shape languages. Most of the exist...
We introduce a shape descriptor that is based on the Symmetry Set. This set represents pairwise symm...
Shape grammars are a generative formalism in which dynamic changes to shape structure plays a vital ...
A shape grammar provides the means to synthesize designs in the language defined by its rules throug...
We propose and describe a working computer implementation for shape grammars that handles embedding ...
NP-hardness of parametric subshape recognition for an arbitrary number of open terms is proven. Guid...
Abstract: NP-hardness of parametric subshape recognition for an arbitrary number of open terms is pr...
The paper starts by giving a motivation for studying grammars in design and is based on consideratio...
Application of a shape grammar involves the repetitive task of matching and replacing subshapes of a...
Previously, we examined tractable parametric shape grammars and developed a general paradigm for imp...
International audienceAnalysis of intrinsic symmetries of non-rigid and articulated shapes is an imp...
Shape grammars specify a mechanism for performing recursive shape computations. A general paradigm i...
Abstract: This paper explores the theoretical basis for a concept of “computation-friendly” shape gr...
Abstract. Shape grammars specify a mechanism for performing recursive shape computations. A general ...
We introduce S2, a typed intermediate language for vectors, based on a 2-level type-theory, which di...
Shape grammars are rule-based formalisms for the specification of shape languages. Most of the exist...
DOI
Add to ORKG