added activity to related work

tex_review/chapters/transition.tex

@@ -104,11 +104,16 @@
 		It thus is always possible to walk from one polygon into another,
 		if they are adjacent.
 		Similar to the graph-based approach, adjacent polygons 
-		denote some sort of walkable surface.
-		Just as before, the navigation mesh can be \emph{automatically}
+		denote some sort of walkable surface.}
+		\addy{However, while a graph restricts the movement to edges and nodes, the mesh allows for a 
+		true continues movement. 
+		This is achieved by having the freedom to walk to any position, under the condition that it 
+		resides within a polygon.}
+		\add{Just as before, the navigation mesh can be \emph{automatically}
 		generated from the building's floor plan, based on
-		various algorithms \cite{navMeshAlg1}.
-	}
+		various algorithms \cite{navMeshAlg1, kallmann2010navigation}.
+		}
+
 	Using variably shaped/sized elements instead of rigid grid-cells
 	provides both, higher accuracy for reaching every corner, and a reduced
 	memory footprint as a single polygon is able to cover arbitrarily