I’ve got a question, I got the following code to check the intersection between two paths defined by a series of geographical points. The solution involves an R-Tree search for better processing time, however, I am doing the approximation of converting the coordinates into cartesian points, keeping in mind that I am not dealing with distances above 50-80 meters. Is this approximation correct and reasonably accurate?