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 $\mathcal{O}$ of obstacles in ${\mathbb{R}}^2$, in which we wish to compute a short path between two points while also maintaining a high…