Index: TRBS/trbs.html =================================================================== --- TRBS/trbs.html (revision 537) +++ TRBS/trbs.html (revision 538) @@ -2,9 +2,9 @@

Triangulated Rubber Band Sketch

Rationale

I. Rationale

Context

II. Context

netlist -> LAA -> NORD -> TRBS -> embed geometry

@@ -65,7 +65,7 @@

This document focuses on the TRBS step. -

TRBS data model

III. TRBS data model

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

TRBS algorithm: path finding

IV. TRBS algorithm: path finding

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

there's no straight-line visibility from the current edge to the target edge or target vertex within the triangle (it is blocked by a 2net - placed earlier) + placed earlier); visibility is calucated as described below, in + section V. -

TRBS algorithm: query in-triangle visibility

V. TRBS algorithm: query in-triangle visibility

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

TRBS algorithm: example cases

VI. TRBS algorithm: example cases

Case 1: path (green) going out from a vertex of the current triangle does not change the result of the visibility test: