**Papers Published**

- Bejan, A. and Ledezma, G.A.,
*Streets tree networks and urban growth: optimal geometry for quickest access between a finite-size volume and one point*, Physica A (Netherlands), vol. 255 no. 1-2 (1998), pp. 211 - 17 [S0378-4371(98)00085-5] .

(last updated on 2007/04/06)**Abstract:**

The geometric form of the tree network is deduced from a single mechanism. The discovery that the shape of a heat-generating volume can be optimized to minimize the thermal resistance between the volume and a point heat sink, is used to solve the kinematics problem of minimizing the time of travel between a volume (or area) and one point. The optimal path is constructed by covering the volume with a sequence of volume sizes (building blocks), which starts with the smallest size and continues with stepwise larger sizes (assemblies). Optimized in each building block is the overall shape and the angle between constituents. The speed of travel may vary from one assembly size to the next, however, the lowest speed is used to reach the infinity of points located in the smallest volume elements. The volume-to-point path that results is a tree network. A single design principle - the geometric optimization of volume-to-point access - determines all the features of the tree network**Keywords:**

fractals;optimisation;town and country planning;trees (mathematics);