Index: TRBS/trbs.html
===================================================================
--- TRBS/trbs.html	(revision 552)
+++ TRBS/trbs.html	(revision 553)
@@ -30,7 +30,7 @@
 <p>
 	<center>
 	<p><br>&nbsp;<br>&nbsp;
-	<p><img src="tri.png" alt="trianglulation" width="500px">
+	<p><img src="tri.png" alt="triangulation" width="500px">
 	<p><i>Figure 1: triangulation; grey lines are triangle edges; yellow lines
 	   are three 2nets to route</i>
 	<p><br>&nbsp;<br>&nbsp;
@@ -41,7 +41,7 @@
 yields <b>vertices</b> (at obstacles) and <b>edges</b> that connect the vertices
 and <b>triangles</b> (defined by 3 vertices or 3 edges).
 <p>
-2nets are routed on a <b>path</b> from a starting vertext through edge crossings until it
+2nets are routed on a <b>path</b> 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.
 <p>
@@ -140,7 +140,7 @@
 	<p><img src="astar.png" alt="A* path finding examples" width="700px">
 	<p><i>Figure 5: path finding with A*;
 		<br>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) </i>
 		<br>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 @@
 <p>
 <ul>
 	<li> 1. start walking the triangle (edge) from the entering point in
-	     one direction, e.g. ccw
+	     one direction, e.g. CCW
 	<li> 2. move along an edge until a crossing or vertex is detected
 	<li> 3. if vertex:
 	<ul>