{\tt
\begin{center}
\baselineskip=12pt
\fbox{ \parbox{6in}{
\begin{tabbing}
xxxxx\=yyyyy\=zzzzz\=aaaaa\= \kill
COUNTERS \\
\> p, q, r, $p^{*}$, $q^{*}$, $r^{*}$ \\
\\
SETS (subsets of the original vertices)\\
\> AP, AQ \\
\\
Q\_list STRUCTURE DEFINITIONS \\
\> E(p) --  \> \> The coordinates of the point p\\
\> H(p) --  \> \>The height of the tree with p as the root \\
\> V(p) --  \> \>The vertices in the tree with p as the root \\
\> L(p) --  \> \>The left child of the node p \\
\> R(p) --  \> \>The right child of the node p \\
\> LBL(p) --\> \>The Label associated with node p, \\
\>          \> \> used to determine which one of two orientations\\
\>          \> \> the associated Steiner Point would take. \\
\> LF(p) -- \> \> The leftmost leaf in the tree with p as the root \\
\> MIN(p) -- \> \>The minimum number of nodes needed above p for it\\
\>          \> \> to be considered for membership in T\_list\\
\> LSP(p) -- \> \> Left most leaf on the Steiner Polygon of the tree\\
\>          \> \> with p as the root.\\
\> RSP(p) -- \> \> Right most leaf on the Steiner Polygon of the tree\\
\>          \> \> with p as the root.\\
T\_list STRUCTURE DEFINITIONS \\
\> SROOT(t) -- \> \> The Top of the Extended Binary Tree (FST)\\
\> ROOT(t) --\> \> The child of the SROOT(t)\\
\end{tabbing}
}}
\end{center}
}
