...
首页> 外文期刊>Physica, A. Statistical mechanics and its applications >Streets tree networks and urban growth: Optimal geometry for quickest access between a finite-size volume and one point
【24h】

Streets tree networks and urban growth: Optimal geometry for quickest access between a finite-size volume and one point

机译:街道树木网络和城市发展:最佳几何形状,可在有限大小的体积和一个点之间实现最快的访问

获取原文
获取原文并翻译 | 示例
           

摘要

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. (C) 1998 Elsevier Science B.V. All rights reserved. [References: 9]
机译:树状网络的几何形式是从单一机制推导出来的。可以优化发热体的形状以最小化容积与点散热器之间的热阻的发现,被用于解决最小化容积(或区域)与一个容积(或面积)之间的传播时间的运动学问题。点。最佳路径是通过用一系列体积尺寸(构造块)覆盖体积来构建的,该体积尺寸序列从最小尺寸开始,然后逐步增大尺寸(装配体)。在每个构造块中优化的是整体形状和要素之间的角度。行进速度可能因一个组件的大小而异,但是,最低的速度用于到达位于最小体积元素中的点的无穷大。生成的卷到点路径是一个树形网络。单一设计原则-卷对点访问的几何优化-确定树网络的所有功能。 (C)1998 Elsevier Science B.V.保留所有权利。 [参考:9]

著录项

相似文献

  • 外文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号