Index: TRBS/Makefile =================================================================== --- TRBS/Makefile (revision 541) +++ TRBS/Makefile (revision 542) @@ -1,5 +1,5 @@ DPI=300 -PICS = 2net.png 3net.png passthru1.png passthru2.png passthru3.png tri.png +PICS = 2net.png 3net.png passthru1.png passthru2.png passthru3.png tri.png uturn.png all: $(PICS) Index: TRBS/trbs.html =================================================================== --- TRBS/trbs.html (revision 541) +++ TRBS/trbs.html (revision 542) @@ -83,7 +83,16 @@ be any number of crossings, from zero up, but any time the 2net is crossing a triangulation edge, there must be a crossing created.

-Note: multiple crossing points of the same 2net-edge can occur [TODO: drawing]. +Note: multiple crossing points of the same 2net-edge can occur, as shown on +Figure 3. +

+


 
  +

repeated crossings +

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. +


 
  +

Each 2net is specified by a starting and an ending triangulation vertex and an ordered doubly linked list of crossings. Which @@ -140,7 +149,7 @@


 
 

in-triangle visibility algorithm -

Figure 3: edge-to-edge visibility in a triangle; annotations are +

Figure 4: edge-to-edge visibility in a triangle; annotations are drawn with red, existing paths with blue


 
 

@@ -150,7 +159,7 @@ inserted between edge end vertices or existing crossings). In case of target vertex, the output is a boolean, whether that vertex is visible or not.

-The algorithm for determining visibility (e.g. on Figure 3) is: +The algorithm for determining visibility (e.g. on Figure 4) is: