Hostname: page-component-7bb8b95d7b-2h6rp Total loading time: 0 Render date: 2024-09-13T18:05:02.589Z Has data issue: false hasContentIssue false
  • English
  • Français

Diagonal decompositions of shapes and their algebras

Published online by Cambridge University Press:  09 February 2022

Djordje Kristic Open the ORCID record for Djordje Kristic [Opens in a new window]
Djordje Kristic*
Affiliation:
Independent Research, 22415 Kearny St., Calabasas, CA91302, USA
*
Author for correspondence: Djordje Krstic, E-mail: [email protected]
Get access Rights & Permissions [Opens in a new window]

Abstract

The formal approach to shapes and their algebras, as it appears in shape grammar theory, has been reviewed. It starts with geometric elements and their partial algebras, continues to shapes, their algebras, and boundaries, as well as algebras that calculate with shapes and their boundaries. There is a number of new concepts introduced along the way. These include diagonal decompositions and their algebras which simplify calculations with shapes, b-paired diagonal decompositions which extend calculations with shapes and their boundaries from diagonal shapes only to all shapes, and m-order boundaries which extend the concept of shape boundaries and allow for calculations with multiple representations of shapes. It also shows that algebras of shapes are infinite direct sums of diagonal algebras.

Keywords

Algebras of shapesdiagonal algebras of shapesshapeshape decompositions
Type
Research Article
Information
AI EDAM , Volume 36 , 2022 , e10
Check for updates
Copyright
Copyright © The Author(s), 2022. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

References

Birkhoff, G (1993) Lattice Theory, 3rd Edn. Providence, RI: American Mathematical Society.Google Scholar
Earl, CF (1997) Shape boundaries. Environment and Planning B: Planning and Design 17, 669–687.CrossRefGoogle Scholar
Jowers, I (2006) Computation with Curved Shapes: Towards Freeform Shape Generation in Design (PhD Thesis). The Open University.Google Scholar
Krishnamurti, R (1980) The arithmetic of shapes. Environment and Planning B: Planning and Design 7, 463–484.CrossRefGoogle Scholar
Krishnamurti, R (1992) The maximal representation of a shape. Environment and Planning B: Planning and Design 19, 267–288.CrossRefGoogle Scholar
Krishnamurti, R and Stouffs, R (2004) The boundary of a shape and its classification. Journal of Design Research 4, 75–101.CrossRefGoogle Scholar
Krstic, D (1999) Constructing algebras of design. Environment and Planning B: Planning and Design 19, 267–288.Google Scholar
Krstic, D (2001) Algebras and grammars for shapes and their boundaries. Environment and Planning B: Planning and Design 19, 267–288.Google Scholar
Krstic, D (2005) Shape decompositions and their algebras. Artificial Intelligence for Engineering Design, Analysis and Manufacturing 19, 261–276.CrossRefGoogle Scholar
Krstic, D (2014) Algebras of shapes revisited. In Gero, J (ed.), Design Computing and Cognition ’12. Springer Science+Business Media B. V, pp. 361–376.Google Scholar
Krstic, D (2019) Grammars for making revisited. In Gero, J (ed.), Design Computing and Cognition ’18. Springer Science+Business Media B. V, pp. 479–496.CrossRefGoogle Scholar
Krstic, D (2020) Spatial and nonspatial in calculations with shapes. In Gero, J (ed.), Design Computing and Cognition ’20. Springer Science+Business Media B. V.Google Scholar
Stiny, G (1991) The algebras of design. Research in Engineering Design 2, 171–181.CrossRefGoogle Scholar
Stiny, G (1992) Weights. Environment and Planning B: Planning and Design 19, 413–430.CrossRefGoogle Scholar
Stiny, G (2006) Shape: Talking About Seeing and Doing. Cambridge, MA: The MIT Press.CrossRefGoogle Scholar
Stiny, G and Gips, J (1972) Shape grammars and the generative specification of painting and sculpture. In Freiman, CV (ed.), Information Processing ’71: Proceedings of the IFIP Congress, Vol. 71, Amsterdam: North Holland, pp. 1460–1465; and also (1972) In Petrocelli OR (ed.), The Best Computer Papers of 1971. Auerbach Publishers, pp. 125–135.Google Scholar