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

Abstract

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

Citations (3)*help

See more

Details 詳細情報について

Report a problem

Back to top