added a new structure to the FastKdTree to return all triangles with
intersection in the coming up intersectAll method.

~FIX: testmain.cpp uncommented a line to build up the kdtree
Added the method intersectAll to the fastKdtree. Still a stub!
Added the new struct IntersectionData and now converted the whole
calculation.

The implementation is not checked yet.
removed an unused variable
added comments to the strcut IntersectionData and made the return value
of the vector with TriangleVerticeRefs const, because the iterators for
the triangle in the FastKdTree stores the TriangleVerticeRefs const.
added a new field to the intersectionData which stores the distance to
the triangle on the same index in the struct.

this addition allows an easy search for the nearest triangle in
intersectFirst
added a small comment
debuged the new structure with returning all triangles and it works
fine!
Merge branch 'fastkdtree-SS13-group1' of https://github.com/happah-

Conflicts:
	happah/kdtree/FastKdTree.cpp