Bibliography   Index

 

Sortal structures

From sorts to sortal structures

  • R. Stouffs, 2008, Constructing design representations using a sortal approach, Advanced Engineering Informatics 22(1), 71-89, Special Section on Intelligent Computing in Engineering and Architecture. [pdf 1.5MB]
  • R. Stouffs, R. Krishnamurti and K. Park, 2007, Sortal structures: supporting representational flexibility for building domain processes, Computer-Aided Civil and Infrastructure Engineering 22(2), 98-116, Special Issue on Product Models (eds. A. Watson and C. Eastman). [pdf 770KB]
  • R. Stouffs and A. ter Haar, 2006, Constructing design representations, Intelligent Computing in Engineering and Architecture (ed. I.F.C. Smith), Lecture Notes in Artificial Intelligence 4200, Springer, Berlin, 653-662. [pdf 224KB]
  • R. Stouffs, R. Krishnamurti and A. ter Haar, 2006, A sortal building model supporting interdisciplinary design communication. Building on IT: Joint International Conference on Computing and Decision Making in Civil and Building Engineering (eds. H. Rivard, E. Miresco and H. Melhem), Montréal, Canada, 2056-2065. [pdf 356KB]
  • R. Stouffs and R. Krishnamurti, 2004, Data views, data recognition, design queries and design rules, Design Computing and Cognition '04 (ed. J.S. Gero), Kluwer Academic, Dordrecht, The Netherlands, 219-238. [pdf 222KB]
  • R. Stouffs and R. Krishnamurti, 2002, Representational flexibility for design, Artificial Intelligence in Design ‘02 (ed. J.S. Gero), Kluwer Academic, Dordrecht, The Netherlands, 105-128. [pdf 232KB]
  • R. Stouffs, B. Tunçer and G. Schmitt, 1998, Supports for information and communication in a collaborative building project, Artificial Intelligence in Design 98 (eds. J. Gero and F. Sudweeks), Kluwer Academic, Dordrecht, The Netherlands, 601-617.
  • R. Stouffs and R. Krishnamurti, 1997, Sorts: a concept for representational flexibility, CAAD Futures 1997 (ed. R. Junge), Kluwer Academic, Dordrecht, The Netherlands, 553-564. [pdf 91KB]

 

Shape computation

Shape computation for sortal structures

  • 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: 21 November 2016, webmaster @ sortal.org