* Added LINETREE collision search algorithm.
This algorithm uses a tree to check if any two particle trajectories overlapped during the last timestep. This
should be beneficial in large N, low density situation as it allows for much larger timesteps. A modification of the
collision resolve routine might be necessary to allow for multiple collisions of the same particle during one timestep.
This depends on the application and the default is to only allow one collision per timestep.