Emerging Spanning Trees in the Work of Candilis–Josic–Woods

Abstract

This paper introduces the use of graph theory for the study of the work of Candilis–Josic–Woods. Α short introduction to the architects’ main strategies as members of Team Χ and CIAM (Congrès Internationaux d’Architecture Moderne) critics is given. Geometry and computational design methods for city planning and design are briefly discussed. Definitions of the minimum spanning tree, the shortest walk tree and the Steiner tree are then developed. The research projects these methods onto the main principles of Candilis–Josic–Woods’ planning and urban design approach to reinforce their strategic concepts. Distance-related and proximity-based ideas and their importance are sought in the literature related to Candilis–Josic–Woods’ body of work. Algorithmic based examples approximating a Euclidean Steiner tree are shown and discussed in the context of Candilis–Josic–Woods’ syntax. This paper argues that the generation of additional points through the use of a Euclidean Steiner tree algorithmic process is of importance in the work of Candilis–Josic–Woods as it allows for a systematic but emerging creation of hubs that can be activated as space on the one hand, and facilitate pedestrian circulation on the other. The project seeks to demonstrate the relevance of the triplet’s design methods to today’s complex networks of urban environments.