-
Figure 2: three networks routed; first the two horizontal ones then +
Figure 2: three networks (blue) routed by this algorithm; first the two horizontal ones then the vertical one
-
Figure 2: three networks routed; first the two horizontal ones then +
Figure 2: three networks (blue) routed by this algorithm; first the two horizontal ones then the vertical one
Figure 3: the blue net between A and B need to make detours around other (blue) nets. On the way, it crosses some edges (marked with red) - twice, at different locations. + twice, at different locations. Blue nets are routed by this algorithm
@@ -150,7 +150,7 @@
Figure 4: edge-to-edge visibility in a triangle; annotations are - drawn with red, existing paths with blue + drawn with red, existing paths (routed with this algorithm) are drawn with blue
@@ -198,7 +198,7 @@
-
Figure 5: blue and green nets starting from triangle vertices, still +
Figure 5: blue and green nets (routed by this algorithm) starting from triangle vertices, still S2 finds its target edge point