most citedFaster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

1 citations · 1 across the 2 of their papers we have counts for

collaborators

2 papers

cs.RO2023

Reducing Redundant Work in Jump Point Search

Shizhe Zhao, Daniel Harabor, Peter J. Stuckey

JPS (Jump Point Search) is a state-of-the-art optimal algorithm for online grid-based pathfinding. Widely used in games and other navigation scenarios, JPS nevertheless can exhibit…

cs.AI2018★ 1 cited

Faster and More Robust Mesh-based Algorithms for Obstacle k-Nearest Neighbour

Shizhe Zhao, Daniel D. Harabor, David Taniar

We are interested in the problem of finding nearest neighbours in the plane and in the presence of polygonal obstacles (). Widely used algorithms for OkNN are ba…