Enhance speed of closest segment calculus
Implement a multithread calculus to find the closest street segment.
First idea: create one thread for each path (not for each segment). Each thread can therefore return the closest candidate. Afterwards, the absolute closest candidate is selected.
Second: one thread for each compass angle range
This issue needs completion of #1 (closed) .
Edited by Ghost User