ROAD NETWORK PATTERNS AND THE MINIMUM LENGTH OF A CIRCUIT

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.