@@ -978,8 +978,8 @@ The vertices of $X$ are found by solving the system

...

@@ -978,8 +978,8 @@ The vertices of $X$ are found by solving the system

where $\vec{v}_0$ is the vertex of $V$ mapped to the origin, $\vec{v}_i$ is the vector between $\vec{v}_0$ and the $i$--th vertex of $V$, and the columns of $\hat{U}$ are the vertices of $U$.

where $\vec{v}_0$ is the vertex of $V$ mapped to the origin, $\vec{v}_i$ is the vector between $\vec{v}_0$ and the $i$--th vertex of $V$, and the columns of $\hat{U}$ are the vertices of $U$.

A vertex of $X$, $\vec{x}_i$, lies inside $Y$ only if $\vec{x}_i \cdot\vec{e}_\gamma\geq0$ for all $\gamma$.

A vertex of $X$, $\vec{x}_i$, lies inside $Y$ only if $\vec{x}_i \cdot\vec{e}_\gamma\geq0$ for all $\gamma$.

It is also necessary that $1-\vec{x}_i \cdot\vec{1}\geq0$, where $\vec{1}=\sum\vec{e}_\gamma$.

It is also necessary that $1-\sum\vec{x}_i \cdot\vec{e}_\gamma\geq0$.

For the sake of notation we denote $\vec{x}\cdot\vec{e}_0=1-\vec{x}\cdot\vec{1}$.

For the sake of notation we denote $\vec{x}\cdot\vec{e}_0=1-\sum\vec{x}_i\cdot\vec{e}_\gamma$.

The $(ij)$--th edge of $X$ intersects an $(n-1)$--dimensional hyperplane of $Y$, defined as $P_\gamma=\Set{\vec{x}\in\bbr^n}{\vec{x}\cdot\vec{e}_\gamma=0}$, if $\sign(\vec{x}_i \cdot\vec{e}_\gamma)\neq\sign(\vec{x}_j \cdot\vec{e}_\gamma)$.

The $(ij)$--th edge of $X$ intersects an $(n-1)$--dimensional hyperplane of $Y$, defined as $P_\gamma=\Set{\vec{x}\in\bbr^n}{\vec{x}\cdot\vec{e}_\gamma=0}$, if $\sign(\vec{x}_i \cdot\vec{e}_\gamma)\neq\sign(\vec{x}_j \cdot\vec{e}_\gamma)$.

Proposition \ref{prop:tetra intersections} can be extended to this general dimension.

Proposition \ref{prop:tetra intersections} can be extended to this general dimension.

...

@@ -1131,4 +1131,19 @@ Each step of the algorithm has been proven to be self-consistent and consistent

...

@@ -1131,4 +1131,19 @@ Each step of the algorithm has been proven to be self-consistent and consistent

By induction, the algorithm as a whole is consistent for any dimension.

By induction, the algorithm as a whole is consistent for any dimension.

\end{proof}

\end{proof}

If we apply this general algorithm to dimenion 3 and the intersection of two tetrahedra then we expect to retrieve identical results to the algorithm proposed in the previous sections.

In this particular case $\vec{x}_i =\begin{bmatrix} x_i & y_i & z_i \end{bmatrix}^\top$.

The first two steps of the algorithms already correspond to one another.

In the third step of the general algorithm $\vec{h}(\set{i,k} | \set{j})\cdot\vec{e}_\eta$ is calculated.

This is identical to $q^{ik}_x$ from the tetrahedral algorithm.

It is straightforward to work out that the other combinations of $j$ and $\eta$ will give the equations for $q^{ik}_\gamma$, $r^{ik}_\gamma$ and $1-q^{ik}_\gamma-r^{ik}_\gamma$.

Likewise, one can show the calculations in step m, repeated once in this case, are identical to those of step 2bi of the tetrahedral algorithm.

Since these calculations are the same, the comparison of the signs of the intersections will return the same results.

Thus, both algorithms will agree as to which vertices of $Y$ lie inside $X$.