Using simple kd-tree for boosting speed of finding nearest object, which intersects with ray - complexity is O(log(N))