532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
All the points that are left are either nearer to themselves or to branches other than on the network. These may be called hypothetical diagonals or virtual segments. The name pops up as they are hypothetical diagonals or virtual segments which can still be joined between the points on the already existing network of [Fig.4]
THE NEXT NETWORK CASE
After we have the original network intact we start with other independent points, independent in the sense they are nearer to themselves than to any of the points on the existing network. We repeat the same process of the general domain till all the points gets exhausted [refer to Fig. 5].
Space for Fig. 5
So our net shortest route may now look like fig. 5. We have taken four networks for simplicity.
The four networks are respectively the shortest route between the particles of the corresponding networks .We now use segment rule to join these networks.
It is that the networks are joined via the closest segment.
The segment length is calculated as follows. (For details refer section 6.4)
‘a + b -c -d ’; Here a ,b are adding distance & c , d are subtracting distances.
Suppose we have to join A1A2 to B2B3 [Refer Fig. 6].
The net adding distance is a =A1B2
b =A2B3 &
Net subtracting distance is A1A2 & B2B3. Similarly we check for other segment B3B4 (say).
For whichever two segments the ‘a +b -c -d’ is minimum we join them.
Next case is the case of hypothetical diagona<