Bibliography   Index

 

Sortal grammar interpreter

Reporting on consecutive versions of a sortal grammar interpreter

  • B. Dy and R. Stouffs, 2018, Combining geometries and descriptions - a shape grammar plug-in for Grasshopper, Computing for a better tomorrow (eds. A. Kepczynska-Walczak and S. Bialkowski), vol. 2, pp. 509-518, eCAADe, Brussels.
  • R. Stouffs, 2018, Where associative and rule-based approaches meet - a shape grammar plug-in for Grasshopper, Learning, Adapting and Prototyping (eds. T. Fukuda, W. Huang, P. Janssen, K. Crolla and S. Alhadidi), vol. 2, pp. 453-462, CAADRIA, Hong Kong.
  • R. Stouffs, 2012, On shape grammars, color grammars and sortal grammars: a sortal grammar interpreter for varying shape grammar formalisms, Digital Physicality, vol. 1 (eds. H. Achten, J. Pavlicek, J. Hulin and D. Matejovska), Czech Technical University in Prague, 479-487. [pdf 423KB]
  • R. Stouffs and R. Krishnamurti, 2004, Grammars, sorts and implementation, Workshop notes of Implementation Issues in Generative Design Systems, First International Conference on Design Computing and Cognition (DCC'04), MIT, Cambridge, Mass., 25-35. [pdf 114KB]

 

Implementation issues

Implementation issues of a sortal grammar interpreter

  • R. Stouffs and R. Krishnamurti, 2019, A uniform characterization of augmented shapes, Computer-Aided Design 110, 37-49. doi:10.1016/j.cad.2018.12.004
  • R. Stouffs, 2018, Implementation issues of parallel shape grammars, AI EDAM (Artificial Intelligence for Engineering Design, Analysis and Manufacturing) 32, 162-176. doi:10.1017/ S0890060417000270
  • T. Wortmann and R. Stouffs, 2018, Algorithmic complexity of shape grammar implementation, AI EDAM (Artificial Intelligence for Engineering Design, Analysis and Manufacturing) 32, 138-146. doi:10.1017/S0890060417000440
  • R. Stouffs, 2016, An algebraic approach to implementing a shape grammar interpreter, Complexity & Simplicity (eds. A. Herneoja, T. Ă–sterlund and P. Markkanen), University of Oulu, Oulu, Finland, 329-338. [pdf 122KB]

 

Shape computation

Shape computation for sortal grammars

  • R. Stouffs and R. Krishnamurti, 2006, Algorithms for classifying and constructing the boundary of a shape, Journal of Design Research 5(1), 54-95. [pdf 1.7MB]
  • R. Krishnamurti and R. Stouffs, 2004, The boundary of a shape and its classification, Journal of Design Research 4(1), 28 pp. [pdf 1.9MB]
  • R. Stouffs and R. Krishnamurti, 2004, Shape algebras for curves and surfaces, Presented at Curves and surfaces in generative design Workshop, First International Conference on Design Computing and Cognition (DCC'04), MIT, Cambridge, Mass., 17 July 2004. [pdf 104KB]
  • R. Stouffs and R. Krishnamurti, 1997, A note on the computational complexity of dealing with the boundary of a shape, Technical report, Chair of Architecture and CAAD, Swiss Federal Institute of Technology Zurich, September 1997.
  • R. Stouffs and R. Krishnamurti, 1996, The extensibility and applicability of geometric representations, Architecture proceedings of 3rd Design and Decision Support Systems in Architecture and Urban Planning Conference, Eindhoven University of Technology, Eindhoven, The Netherlands, 436-452. [pdf 1.8MB]
  • R. Stouffs and R. Krishnamurti, 1994, An algebraic approach to shape computation (a position paper), Workshop notes of Reasoning with Shapes in Design. Artificial Intelligence in Design '94, Swiss Federal Institute of Technology (EPFL), Lausanne, Switzerland, 50-55. [pdf 121KB]
  • R. Stouffs, 1994, The Algebra of Shapes, Ph.D. dissertation, Dept. of Architecture, Carnegie Mellon University, Pittsburgh, Pa.. [pdf 2.4MB]
  • R. Stouffs and R. Krishnamurti, 1993, The complexity of the maximal representation of shapes, Preprints of IFIP Workshop on Formal Methods for Computer-Aided Design, Talinn, Estonia, 16-19 June 1993. [pdf 96KB]
  • R. Krishnamurti, 1992, The arithmetic of maximal planes, Environment and Planning B: Planning and Design 19, 431-464.
  • R. Krishnamurti, 1992, The maximal representation of a shape, Environment and Planning B: Planning and Design 19, 267-288.
  • R. Stouffs and R. Krishnamurti, 1992, Efficient algorithms for boolean operations on plane segments, Technical report, Dept. of Architecture, Carnegie Mellon University, Pittsburgh, Pa., November 1992.

 

 
 
 

Last update: 25 July 2020, webmaster @ sortal.org