Index: trbs.html =================================================================== --- trbs.html (revision 552) +++ trbs.html (revision 553) @@ -30,7 +30,7 @@
-
+
Figure 1: triangulation; grey lines are triangle edges; yellow lines are three 2nets to route
@@ -41,7 +41,7 @@
yields vertices (at obstacles) and edges that connect the vertices
and triangles (defined by 3 vertices or 3 edges).
-2nets are routed on a path from a starting vertext through edge crossings until it +2nets are routed on a path from a starting vertex through edge crossings until it reaches the ending vertex (Figure 2). Paths are abstract, topological: the exact coordinates of the 2nets are not considered, only the order of 2net-edge crossings.
@@ -140,7 +140,7 @@
Figure 5: path finding with A*;
a.: case S: start from vertex S, potential next graph nodes are the
- vertices marked with red arrows (assuming T is not on any neighbour
+ vertices marked with red arrows (assuming T is not on any neighbor
vertex on this drawing)
b.: thick blue line is the path crossing the left edge of a triangle;
since the triangle contains the end vertex T, the only one next node
@@ -193,7 +193,7 @@