Parametric Shape Grammar
A Parametric Shape Grammar is a formal system of shape computation that extends traditional shape grammars by incorporating parametric variables and constraints, enabling the procedural generation of families of shapes through rule applications governed by adjustable numerical or geometric parameters.
40
Publications
2.6K
Citations
85
Authors
53
Institutions
Publications per year
2017–2026
10
Parents
40
1–5 of 40
85
4
h-index
4
h-index
3
h-index
3
h-index
University of California, Los Angeles, United States
3 publications · 711 citations
3
h-index
1–5 of 85
53
Carnegie Mellon University
Pittsburgh, United States
7 h-index
11 publications
322 citations
University of California, Los Angeles
Los Angeles, United States
5 h-index
6 publications
485 citations

The Open University
Milton Keynes, United Kingdom
4 h-index
4 publications
836 citations
Georgia Institute of Technology
Atlanta, United States
3 h-index
4 publications
101 citations
Microsoft (United States)
Redmond, United States
2 h-index
4 publications
81 citations

Hong Kong Polytechnic University
Hong Kong, Hong Kong
2 h-index
4 publications
76 citations
Cardiff University
Cardiff, United Kingdom
2 h-index
3 publications
67 citations
University at Buffalo, State University of New York
Buffalo, United States
2 h-index
2 publications
104 citations
1–8 of 53
17 publications · 1.9K citations
16
h-index
AIEDAM · 6 publications · 203 citations
6
h-index
2 publications · 52 citations
2
h-index
2 publications · 105 citations
2
h-index
IJAC · 2 publications · 32 citations
2
h-index
1–5