Linkages

The linkages.csv file is responsible for linking each block with an entry point on to the road network. See Table 21, “Linkages file format description” for a detailed description of the segment file format.

Table 21. Linkages file format description

Field nameData typeDescription
BLOCKStringAn alphanumeric label that is used to identify the block for matching purposes. The label must match to a value in the block.csv file (see the section called “Blocks”.
NODEStringAn alphanumeric label that is used to identify the node for matching purposes. The label must match to a value in the vertices.csv file.

This file defines the relationship between harvest polygons and the road network, and indicates the closest node to each block. It is assumed that wood harvested within the block polygon will be forwarded to a landing located at the node location.

Each BLOCK that will require road access must have a linkage NODE. The road network must be sufficiently dense (lots of road segments) so that linkages nodes are close to the blocks. The distance from the block to the starting node is roughly analogous to the forwarding distance from the block to the landing, so keep this in mind when preparing the spatial road file. For example if the maximum forwarding distance for a logging operation is 300m, then the road segments should not be longer than 600m.

Several blocks may connect to the same starting node, however each block can only be associated with a single node.

Below is an example of several linkages.csv records:

  BLOCK, NODE
  1, 856
  2, 856
  3, 856
  4, 805
  ...
      

Notice that block 1, 2 and 3 are all linked to node 856. This type of relationship is similar to several blocks forwarding to the same landing.

[Note]Note

You must regenerate this file each time you the block polygon boundary definitions or block id labels in the blocks file.