# HG changeset patch
# User terom
# Date 1228796637 0
# Node ID 6c7b4deefdfb844dcac20ae3f7e9148b034a8860
# Parent  1b87b1e0ae1d1b65d82fcc9acea7f16897be2a5d
add some diagrams to .tex, merged changes

diff -r 1b87b1e0ae1d -r 6c7b4deefdfb doc/images/class_GameState_collaboration_graph.png
Binary file doc/images/class_GameState_collaboration_graph.png has changed
diff -r 1b87b1e0ae1d -r 6c7b4deefdfb doc/images/class_Player_inherit_graph.png
Binary file doc/images/class_Player_inherit_graph.png has changed
diff -r 1b87b1e0ae1d -r 6c7b4deefdfb doc/images/class_player_inherit_graph.png
Binary file doc/images/class_player_inherit_graph.png has changed
diff -r 1b87b1e0ae1d -r 6c7b4deefdfb doc/images/normaali_algo.png
Binary file doc/images/normaali_algo.png has changed
diff -r 1b87b1e0ae1d -r 6c7b4deefdfb doc/kishna.tex
--- a/doc/kishna.tex	Tue Dec 09 04:22:30 2008 +0000
+++ b/doc/kishna.tex	Tue Dec 09 04:23:57 2008 +0000
@@ -148,6 +148,16 @@
 are some nice diagrams about the program structure in the doxygen
 documentation.
 
+\begin{figure}[!ht]
+ \centering \includegraphics[width=\textwidth]{images/class_Player_inherit_graph.png}
+ \caption{Player class inheritance graph. \label{class_Player_inheritance}}
+\end{figure}
+
+\begin{figure}[!ht]
+ \centering \includegraphics[width=\textwidth]{images/class_GameState_collaboration_graph.png}
+ \caption{Relationships of core GameState class. \label{class_GameState_collaboration}}
+\end{figure}
+
 \subsection{Network}
 
 The network code is implemented as separate NetworkServer and NetworkClient modules, which use a common high-level
@@ -200,6 +210,11 @@
 Currently, the client only sends handleInput using unreliable UDP messages, and the server only sends position updates
 (as sent in response to handleInput events) unreliably. All other events are sent using reliable TCP.
 
+\begin{figure}[!ht]
+ \centering \includegraphics[width=\textwidth]{images/class_NetworkObject_inherit_graph.png}
+ \caption{Use of NetworkObject in network code. \label{class_NetworkObject_inherit}}
+\end{figure}
+
 \section{Data structures and algorithms}
 
 \subsection{Basic data structures}
@@ -277,7 +292,7 @@
 Picture \ref{algo} explains the algorithm a lot. In the middle of the pictured we have zoomed to the collision point. The red arrow is the sum of the black arrows and thus it is our approximation for the normal.
 
 \begin{figure}[!ht]
- \centering \includegraphics[width=0.7\textwidth]{normaali_algo.png}
+ \centering \includegraphics[width=0.7\textwidth]{images/normaali_algo.png}
  \caption{Visualizing the algorithm for approximating the normal. \label{algo}}
 \end{figure}
 
@@ -320,8 +335,6 @@
 last density and step diagonal to last density's points -- otherwise it is quite similar
 to the one dimensional version. We decide to implement the algorithm as iterative instead of recursion.
 
-% TODO: something network related?
-
 \subsection{Input}
 
 All input is represented as a bitmask, composed of bits from \textsl{enum PlayerInputBits}. Additionally, the Graphics
diff -r 1b87b1e0ae1d -r 6c7b4deefdfb doc/normaali_algo.png
Binary file doc/normaali_algo.png has changed