Index: trbs.html =================================================================== --- trbs.html (revision 537) +++ trbs.html (revision 538) @@ -2,9 +2,9 @@
netlist -> LAA -> NORD -> TRBS -> embed geometry
@@ -65,7 +65,7 @@
This document focuses on the TRBS step. -
The central data structure describes a crossings of a 2net and an edge. Each crossing is collected in two ordered doubly linked lists: @@ -96,7 +96,7 @@ vertex 2. Which triangulation vertex is called 1 is an arbitrary choice made during triangulation (and never changed later). -
A 2net is always starting from a vertex, will cross zero or more edges (last edge being part of the triangle with the ending vertex), then will connect @@ -120,10 +120,11 @@ than required by the current 2net's routing style
The path is entering a triangle from a vertex or from a specific point on an edge. Point on an edge is in the topological sense, not in the @@ -175,7 +176,7 @@ (go to step 2). -
Case 1: path (green) going out from a vertex of the current triangle does not change the result of the visibility test: