7 citations · 13 across the 4 of their papers we have counts for
Showing 2018 · cs.AIShow all
2 papers · 2 filters
cs.AI2018★ 1 cited
An Efficient Approximation Algorithm for Multi-criteria Indoor Route Planning Queries
Chaluka Salgado, Muhammad Aamir Cheema, David Taniar
A route planning query has many real-world applications and has been studied extensively in outdoor spaces such as road networks or Euclidean space. Despite its many applications i…
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…