The finite motion of rigid bodies in space from one position to another is represented by a dual-vector half-tangent. An algorithmic procedure is presented for obtaining the dual-vector, or motor, in various circumstances, and several special cases are considered. The rule for transforming a...

Making use of data collected by the US Census of Business in 1967, the paper examines the market and organizational characteristics of American architectural, engineering, and land surveying firms with four or more employees.

This paper describes the test of a hypothetical model which is an attempt to explain the relationship between the layout of office interiors and the structure of the organizations housed in them. The theoretical basis for the study was described in the first part of this paper.

The conventions used to construct traditional Chinese ice-ray lattice designs are investigated. Parametric shape grammars are defined for the recursive generation of these patterns.

This paper addresses itself to the question of how and why different societies produce different spatial orders through building forms and settlement patterns. It consists of three parts. Firstly, at a metatheoretical level, it is suggested that spatial organization should be seen as a member of...

This paper presents a comparison of eight methods of representing a general spatial rigid-body screw displacement. A distinction is made between point transformations and line transformations. The following three representations involving point transformations are considered: the real 4 x 4...

The paper describes the minimally redundant sets of diagonal braces in a grid of cubes in space. The language developed is essentially graphical. The methods extend those of the first few sections of an earlier work by Bolker and Crapo (1977).

In this paper we study the mean of the distances in a directed graph and compare the results obtained with the corresponding results for undirected graphs. We derive a formula which enables the computation of best possible upper and lower bounds for the mean of the distances in a directed graph....