22 citations · 43 across the 11 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.CG2017
An Efficient Algorithm for Computing High-Quality Paths amid Polygonal Obstacles
Pankaj K. Agarwal, Kyle Fox, Oren Salzman
We study a path-planning problem amid a set of obstacles in , in which we wish to compute a short path between two points while also maintaining a high…
cs.DS2017★ 22 cited
Efficient Algorithms for k-Regret Minimizing Sets
Pankaj K. Agarwal, Nirman Kumar, Stavros Sintos +1
A regret minimizing set Q is a small size representation of a much larger database P so that user queries executed on Q return answers whose scores are not much worse than those on…