I’ve been working on a pathfinder algorithm that finds the shortest path between 2 points through a given point cloud.
For the most part it is working as intended but I noticed a weird behaviour that I’m trying to fix. The rtree search method seems to be significantly slower if the path is not aligned with the world axes. In one test that I ran, it took 3s to find a straight vertical path, but when I rotated the geometry (the path length and the point cloud remained the same) it took 50s.
I’m currently using this method: RTree.Search method (rhino3d.com)
Is this an expected behaviour? And if it is, how can I make it more efficient for diagonal paths? Would another method like PointCloudClosestPoints perform better in this case?
Any help is appreciated
4 posts - 2 participants