ROAD NETWORK PATTERNS AND THE MINIMUM LENGTH OF A CIRCUIT
-
- FURUYAMA MASAO
- Department of Housing and Environmental Design, Kyoto Institute of Technology:A. I. J.
Bibliographic Information
- Other Title
-
- 模式的道路網とそれを用いた最短巡回路の長さに関する考察
- モシキテキ ドウロモウ ト ソレ オ モチイタ サイタン ジュンカイロ ノ ナ
Search this article
Description
We minimize the total length of the circuit through n points randomly placed by using road networks. The upper bound for the circuit length is given by 2 √<nS> if S is an area. of the convex region with n points. We also show that this upper bound is constant for various kinds of network patterns.
Journal
-
- Journal of Architecture, Planning and Environmental Engineering (Transactions of AIJ)
-
Journal of Architecture, Planning and Environmental Engineering (Transactions of AIJ) 364 (0), 143-149, 1986
Architectural Institute of Japan
- Tweet
Details 詳細情報について
-
- CRID
- 1390282679752910208
-
- NII Article ID
- 110004074538
-
- NII Book ID
- AN10040144
-
- ISSN
- 24330043
- 09108017
-
- NDL BIB ID
- 3092011
-
- Text Lang
- ja
-
- Data Source
-
- JaLC
- IRDB
- NDL
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed