@@ -1086,32 +1086,82 @@ For each of these the numerator of $\vec{h}(J | \Gamma_j) \cdot \vec{e}_j$ is th
By this corollary, if there is a change in sign of $\vec{h}(J | \Gamma)\cdot\vec{e}_\eta$ then the entire $m$--face of $X$ defined by the indices $J$ ends up on the other side of the $(n-m)$--face of $Y$ defined by $\Gamma\cup\set{\eta}$.
If the $J$--th $m$--face of $X$ does not have $m+1$ intersections then the signs of all existing intersections can be found using the intersections of the $(m-1)$--faces of $X$ with indices that are subsets of $J$.
The base case has already been proven in (nb: refer back).
Suppose the statement is true for $m=k$.
That is,
Without loss of generality, suppose $\vec{x}_i$ is the first column of $X_{J \setminus\set{j}}$ and likewise $\vec{x}_j$ is the first column of $X_{J \setminus\set{i}}$.
Furthermore, to adhere to the notation already established the first column of $I_{\Gamma\cup\set{\eta}}$ must be $\vec{e}_\eta$.
By assumption $\vec{h}(J \setminus\set{i} | \Gamma)\cdot\vec{e}_\eta-\vec{h}(J \setminus\set{j} | \Gamma)\cdot\vec{e}_\eta$ has the same sign as $\vec{h}(J \setminus\set{i} | \Gamma)\cdot\vec{e}_\eta$.
Note that since both $J \setminus\set{i}$ and $J \setminus\set{j}$ are indices of intersections their common parent $J \setminus\set{i,j}$ also indexes an intersection.
Thus all elements of the right hand side are calculated in the previous step of the algorithm.
\end{proof}
\subsection{Algorithm for the intersection of n-dimensional simplices}