edgedivide.f

An external edge i with length d and h-value at its nodes of $h_1$ and $h_2$ is divided into n(i)+1 edges satisfying:

$$=\min \left \lbrace \text{int} \left[ \frac{d}{\left( \frac{h_1 + h_2}{2} \right) } -1 \right ] , 1 \right \rbrace,$$ (558)

where int(x) is the integer smaller than or equal to the real number x. This creates at most 2 edges out of 1.