verslag

1 files changed, 9 insertions, 4 deletions

diff --git a/Smoke/report/chapter6.tex b/Smoke/report/chapter6.tex
index dfbb0e8..9dd0f22 100644
--- a/Smoke/report/chapter6.tex
+++ b/Smoke/report/chapter6.tex
@@ -30,23 +30,28 @@ So the algorithm passes through every cell and then checks the four cell vertice
 value. With that value, the algorithm can check if a vertex is inside ($ v_j \geq threshold $) or outside ($ v_j < threshold $) the isosurface. The inside/outside

 state is then stored in a bit. \\

 

+\begin {center}

+  \includegraphics[width=\textwidth]{isolines.png} \\

+  Figure 6: Three fire-like colored isolines on a blue grid \\

+\end {center}

+

 If a vertex, say $ v_0 $ is inside the isosurface, $ v_0 $ is set to 1, else it's left to 0. This is done for all four vertices which results in a 4-bit status.

 This means there are in total 16 different cases in which the isoline can run through a cell. \\

 

 \begin {center}

   \includegraphics[width=\textwidth]{marching.png} \\

-  Figure 6: The 16 marching square cases \\

+  Figure 7: The 16 marching square cases \\

 \end {center}

 

-The above image (figure 6) shows the 16 different cases of the marching squares algorithm. A white vertex indicates that the vertex is outside the isosurface and

+The above image (figure 7) shows the 16 different cases of the marching squares algorithm. A white vertex indicates that the vertex is outside the isosurface and

 black indicates it is inside the isosurface. Every inside or outside case has it's counterpart. So we've reduced the number of cases down to 8. In case 0 and 15 for

 instance, no lines have to be rendered, yet they are both very different cases. \\

 

-The cases 5 and 10 are both ambiguous cases as becomes clear from the next image (figure 7). \\

+The cases 5 and 10 are both ambiguous cases as becomes clear from the next image (figure 8). \\

 

 \begin {center}

   \includegraphics[width=100mm]{ambiguous.png} \\

-  Figure 7: Two ambiguous cases in the marching squares algorithm \\

+  Figure 8: Two ambiguous cases in the marching squares algorithm \\

 \end {center}

 

 \section{Difficulties}